An Ant Colony Optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem
An Ant Colony Optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem
复制标题
DOI：
10.1016/s0377-2217(02)00265-5
复制
发表时间：
2002-10
期刊：
影响因子：
--
通讯作者：
V. T’kindt;N. Monmarché;F. Tercinet;Daniel Laügt
中科院分区：
文献类型：
--
作者：
V. T’kindt;N. Monmarché;F. Tercinet;Daniel Laügt
考虑两台机器的流水作业排序问题，目标是最小化总完工时间和最大完工时间。后者被假定为在前者之前被优化。针对该问题的NP -难性，提出了一种蚁群优化算法来解决该问题，该算法充分利用了模拟退火算法和局部搜索算法的特点。计算实验表明，与现有的算法相比，该算法是有效的。最后，研究了总完工时间问题的推广。
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 NP -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.