A hybrid genetic algorithm for solving no-wait flowshop scheduling problems

作者：Jarboui Bassem; Eddaly Mansour; Siarry Patrick^*

来源：International Journal of Advanced Manufacturing Technology, 2011, 54(9-12): 1129-1143.

DOI：10.1007/s00170-010-3009-4

• No-wait flowshop
• Genetic algorithm
• Variable Neighborhood Search
• Makespan

A hybrid genetic algorithm is proposed in this paper to minimize the makespan and the total flowtime in the no-wait flowshop scheduling problem, which is known to be NP-hard for more than two machines. The Variable Neighborhood Search is used as an improvement procedure in the last step of the genetic algorithm. First, comparisons are provided with respect to several techniques that are representative of the previous works in the area. Then, we compare the results given by three proposed algorithms. For the makespan criterion as well as for the total flowtime, the computational results show that our algorithms are able to provide competitive results and new best upper bounds.

• 出版日期2011-6