多阶段混合Flow Shop调度问题及其遗传求解算法

Genetic Algorithms for Multistage Hybrid Flow Shop Scheduling Problem

针对多阶段混合Ｆｌｏｗ Ｓｈｏｐ 调度问题的一般结构和不同的调度目标函数，提出混合整数规划模型，并基于问题的结构特点设计了遗传求解算法。计算实验结果表明。

This paper considers the multistage hybrid flow shop scheduling problem. A mixed integer-programming model associated with different objective of minimizing makespan and total flow time is given. In view of complexity of the problem and limit of existent researches, an algorithm based on genetic approach is proposed to solve the problem. Some randomly generating problems and lower bounds on objective of makespan and total flow time are used to test and compare the performance of the algorithm. Computational results show that proposed algorithm is rather adaptive and efficient for the problems with different structure, size and objective function.