A composite heuristic for the no-wait flow shop scheduling

被引：0

作者：

Gao Kaizhou ^{[1
]}

Suganthan, P. N. ^{[2
]}

Bao Zhenqiang ^{[3
]}

机构：

[1] Liaocheng Univ, Coll Comp Sci, Liaocheng, Peoples R China

[2] Nanyang Technol Univ, Sch Elect & Elect Engn, Singapore 639798, Singapore

[3] Yangzhou Univ, Coll Informat Engn, Yangzhou, Peoples R China

来源：

2012 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC) | 2012年

基金：

美国国家科学基金会;

关键词：

Flow shop; No-wait; Total flow time; Constructive heuristic; composite heuristic; TOTAL COMPLETION-TIME; MINIMIZATION; MAKESPAN; ALGORITHMS; FLOWSHOPS;

D O I：

暂无

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

Heuristics that explore specific characteristics of the problem are essential to find good solutions in limited computational time for many practical systems. This paper first presents a constructive heuristic, namely improved standard deviation heuristic (ISDH), by combining the standard deviation heuristic (SDH) with the procedure of effective double-job-insert-operator. Then, a composite heuristic, improved standard deviation heuristic with iteration (ISDHI), is proposed using the iteration operator to improve the solutions of the ISDH. Extensive computational experiments are carried out based on a set of well-known flow shop benchmark instances that are considered as no-wait flow shop scheduling instances. Computational results and comparisons show that the ISDHI performs significantly better than the existing ones, and the ISDHI heuristic further improves the proposed constructive heuristics for no-wait flow shop scheduling problem with total flow time criterion.

引用

页数：5

共 27 条

[1] Total flowtime in no-wait flowshops with separated setup times [J].

Aldowaisan, T ;

Allahverdi, A .

COMPUTERS & OPERATIONS RESEARCH, 1998, 25 (09) :757-765

[2] New heuristics for m-machine no-wait flowshop to minimize total completion time [J].

Aldowaisan, T ;

Allahverdi, A .

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2004, 32 (05) :345-352

[3] A new heuristic and dominance relations for no-wait flowshops with setups [J].

Aldowaisan, T .

COMPUTERS & OPERATIONS RESEARCH, 2001, 28 (06) :563-584

[4] 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

[5]

Allahverdi A., 2000, International Transactions in Operational Research, V7, P245, DOI 10.1111/j.1475-3995.2000.tb00197.x

[6] Minimizing total completion time in a no-wait flowshop with sequence-dependent additive changeover times [J].

Allahverdi, A ;

Aldowaisan, T .

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2001, 52 (04) :449-462

[7] Heuristic algorithm for scheduling in the no-wait flow-shop [J].

Bertolissi, E .

JOURNAL OF MATERIALS PROCESSING TECHNOLOGY, 2000, 107 (1-3) :459-465

[8] Genetic algorithms applied to the continuous flow shop problem [J].

Chen, CL ;

Neppalli, RV ;

Aljaber, N .

COMPUTERS & INDUSTRIAL ENGINEERING, 1996, 30 (04) :919-929

[9] Solving the continuous flow-shop scheduling problem by metaheuristics [J].

Fink, A ;

Voss, S .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 151 (02) :400-414

[10] 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

← 1 2 3 →