An ant colony optimization approach to a permutational flowshop scheduling problem with outsourcing allowed

被引：31

作者：

Tavares Neto, R. F. ^{[1
]}

Godinho Filho, M. ^{[1
]}

机构：

[1] Univ Fed Sao Carlos, Dept Ind Engn, BR-13565905 Sao Paulo, Brazil

来源：

COMPUTERS & OPERATIONS RESEARCH | 2011年 / 38卷 / 09期

关键词：

Ant colony optimization; Flowshop scheduling problem; Outsourcing; M-MACHINE; ALGORITHM; MINIMIZE; SEARCH;

D O I：

10.1016/j.cor.2010.11.010

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

This paper deals with the scheduling problem of minimizing the makespan in a permutational flowshop environment with the possibility of outsourcing certain jobs. It addresses this problem by means of the development of an ant colony optimization-based algorithm. This new algorithm, here named as flowshop ant colony optimization is composed of two combined ACO heuristics. The results show that this new approach can be used to solve the problem efficiently and in a short computational time. (C) 2010 Elsevier Ltd. All rights reserved.

引用

页码：1286 / 1293

页数：8