Solving A Variant Of Open Shop Scheduling Problem: A Case Study Of Mondelez Vietnam

Abstract

This dissertation investigates the open shop production scheduling problem (OSSP), focusing on minimizing the makespan in complex industrial environments with constraints like machine blocking, non-preemption, and operation repetition. Using Ant Colony Optimization (ACO), the study develops both exact and approximate methods. Proposed constructive heuristics are compared against exact methods to evaluate their performance. This research aims to enhance the OSSP literature by offering efficient solutions for new variants, addressing real industrial constraints, and providing a foundation for future studies in constrained scheduling environments.