Robust scheduling of a two-stage hybrid flow shop with uncertain interval processing times
研究两阶段混合流水车间中最小化最大完工时间的鲁棒调度问题，提出精确和启发式算法，并通过实验评估性能。
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.