Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic

被引：10

作者：

Li, Xiangyong ^{[2
]}

Baki, M. F. ^{[1
]}

Aneja, Y. P. ^{[1
]}

机构：

[1] Univ Windsor, Odette Sch Business, Windsor, ON N9B 3P4, Canada

[2] Tongji Univ, Sch Econ & Management, Shanghai 200092, Peoples R China

来源：

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

关键词：

Scheduling; Integer programming; Ant colony optimization; Metaheuristic; 2-MACHINE OPEN SHOP; SETUP TIMES; SINGLE-SERVER; COMPONENTS; MACHINES; JOBS;

D O I：

10.1016/j.cor.2010.04.009

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

This paper studies the one-operator m-machine flow shop scheduling problem with the objective of minimizing the total completion time. In this problem, the processing of jobs and setup of machines require the continuous presence of a single operator. We compare three different mathematical formulations and propose an ant colony optimization based metaheuristic to solve this flow shop scheduling problem. A series of experiments are carried out to compare the properties of three formulations and to investigate the performance of the proposed ant colony optimization metaheuristic. The computational results show that (1) an assignment-based formulation performs best, and (2) the ant colony optimization based metaheuristic is a computationally efficient algorithm. (C) 2010 Elsevier Ltd. All rights reserved.

引用

页码：152 / 164

页数：13

共 29 条

[1] A survey of scheduling problems with setup times or costs [J].

Allahverdi, Ali ;

Ng, C. T. ;

Cheng, T. C. E. ;

Kovalyov, Mikhail Y. .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 187 (03) :985-1032

[2] SCHEDULING PRODUCTION OF COMMON COMPONENTS AT A SINGLE FACILITY [J].

ANEJA, YP ;

SINGH, N .

IIE TRANSACTIONS, 1990, 22 (03) :234-237

[3]

[Anonymous], 2004, ANT COLONY OPTIMIZAT

[4] SCHEDULING THE PRODUCTION OF COMPONENTS AT A COMMON FACILITY [J].

BAKER, KR .

IIE TRANSACTIONS, 1988, 20 (01) :32-35

[5]

BAKI F, 1999, THESIS U WATERLOO CA

[6]

Baki MF, 2003, INFOR, V41, P301

[7] One-operator, two-machine open shop and flow shop problems with setup times for machines and weighted number of tardy jobs objective [J].

Baki, MF ;

Vickson, RG .

OPTIMIZATION METHODS & SOFTWARE, 2004, 19 (02) :165-178

[8]

BIRATTARI M, 2005, THESIS U LIBRE BRUXE

[9] The hyper-cube framework for ant colony optimization [J].

Blum, C ;

Dorigo, M .

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2004, 34 (02) :1161-1172

[10] Complexity results for flow-shop problems with a single server [J].

Brucker, P ;

Knust, S ;

Wang, GQ .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 165 (02) :398-407

← 1 2 3 →