An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems

被引：137

作者：

Jarboui, Bassem ^{[2
]}

Eddaly, Mansour ^{[2
]}

Siarry, Patrick ^{[1
]}

机构：

[1] Univ Paris 12, LiSSi, F-94010 Creteil, France

[2] FSEGS, Sfax 3018, Tunisia

来源：

COMPUTERS & OPERATIONS RESEARCH | 2009年 / 36卷 / 09期

关键词：

Estimation of distribution algorithm; Variable neighbourhood search; Scheduling; Permutation flowshop; Flowtime; VARIABLE NEIGHBORHOOD SEARCH; PARTICLE SWARM OPTIMIZATION; HEURISTIC ALGORITHM; COMPLETION-TIME; MINIMIZATION; BRANCH; SHOPS; JOBS;

D O I：

10.1016/j.cor.2008.11.004

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

In this work we propose an estimation of distribution algorithm (EDA) as a new tool aiming at minimizing the total flowtime in permutation flowshop scheduling problems. A variable neighbourhood search is added to the algorithm as an improvement procedure after creating a new offspring. The experiments show that our approach outperforms all existing techniques employed for the problem and can provide new upper bounds. (C) 2008 Elsevier Ltd. All rights reserved.

引用

页码：2638 / 2646

页数：9

共 28 条

[1] New heuristics to minimize total completion time in m-machine flowshops [J].

Allahverdi, A ;

Aldowaisan, T .

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2002, 77 (01) :71-83

[2]

[Anonymous], 2006, NEW EVOLUTIONARY COM

[3]

Bansal S. P., 1977, AIIE Transactions, V9, P306, DOI 10.1080/05695557708975160

[4] A branch and bound algorithm to minimize the total flow time for m-machine permutation flowshop problems [J].

Chung, CS ;

Flynn, J ;

Kirca, O .

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2002, 79 (03) :185-196

[5] Comparison of heuristics for flowtime minimisation in permutation flowshops [J].

Framinan, JA ;

Leisten, R ;

Ruiz-Usano, R .

COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (05) :1237-1254

[6] An efficient constructive heuristic for flowtime minimisation in permutation flow shops [J].

Framinan, JM ;

Leisten, R .

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2003, 31 (04) :311-317

[7] An ant-colony optimization algorithm for minimizing the completion-time variance of jobs in flowshops [J].

Gajpal, Y ;

Rajendran, C .

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2006, 101 (02) :259-272

[8]

Garey M. R., 1976, Mathematics of Operations Research, V1, P117, DOI 10.1287/moor.1.2.117

[9]

Graham R. L., 1979, Discrete Optimisation, P287

[10] Flowshop scheduling research after five decades [J].

Gupta, JND ;

Stafford, EF .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 169 (03) :699-711

← 1 2 3 →