International Journal of Production Research · 2016 · 64 citations · 24 references
ManagementIndustrial EngineeringOperations ManagementOptimizationProduction PlanningSchedulingFlow Shop SchedulingJob SequencingMachine SchedulingMakespan MinimizationProduction SchedulingSchedule OptimizationFlow ShopHeuristic AlgorithmsHybrid Flow Shop SchedulingMakespan OptimizationRobust Flow Shop SchedulingRobust SchedulingTwo-machine Flow Shop SchedulingWorst-case Scenario
This paper studies the makespan minimisation scheduling problem in a two-stage hybrid flow shop. The first stage has one machine and the second stage has m identical parallel machines. Neither the processing time nor probability distribution of the processing time of each job is uncertain. We propose a robust (min–max regret) scheduling model. To solve the robust scheduling problem, which is NP-hard, we first derive some properties of the worst-case scenario for a given schedule. We then propose both exact and heuristic algorithms to solve this problem. In addition, computational experiments are conducted to evaluate the performance of the proposed algorithms.
24
The Complexity of Flowshop and Jobshop Scheduling
M. R. Garey, David Johnson, Ravi Sethi · Mathematics of Operations Research · 1976 · 2.6K citations