加工时间为区间数的两阶段流水生产鲁棒调度

Since processing times are usually uncertain in discrete manufacturing industry, it is hard to implement production schedules as planned. The robust scheduling of two-stage flow shop with interval processing times is studied, which aims to solve robust schedules conformed to the Min-Max decision rule. The corresponding original scheduling problem is to minimize total completion times. Firstly, the robust scheduling problem is modeled as a semi-infinite programming formulation. Secondly, three theorems are proved and a hybrid algorithm is provided to combine branch-bound method and genetic algorithm, which contribute to solve the problem effectively and efficiently. At last, a computational experiment is conducted to illustrate the robust scheduling problem that can be solved through the modeling method and the hybrid algorithm proposed in this paper.