An Ant Colony Optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem

作     者：T'kindt, V Monmarché, N Tercinet, F Laügt, D 

作者机构：Ecole Ingenieurs Informat Ind Lab Informat F-37200 Tours France 

出 版 物：《EUROPEAN JOURNAL OF OPERATIONAL RESEARCH》 (欧洲运筹学杂志)

年 卷 期：2002年第142卷第2期

页      面：250-257页

核心收录：

学科分类：1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 070104[理学-应用数学] 0701[理学-数学] 

主　　题：scheduling multiple objective programming Ant Colony Optimization 

摘      要：Consider the 2-machine flowshop scheduling problem with the objective of minimizing both the total completion time and the makespan criteria. The latter is assumed to be optimized prior to the former. In view of the N P-hardness of the problem an Ant Colony Optimization approach is proposed to solve it. The heuristic also uses feature of Simulated Annealing search and local search algorithms. Computational experiments show its effectiveness compared to existing heuristics. The extension to the total completion time problem is also studied. (C) 2002 Published by Elsevier Science B.V.