Title :
A composite heuristic for the no-wait flow shop scheduling
Author :
Kaizhou, Gao ; Suganthan, P.N. ; Zhenqiang, Bao
Author_Institution :
Coll. of Comput. Sci., Liaocheng Univ., Liaocheng, China
Abstract :
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.
Keywords :
computational complexity; flow shop scheduling; iterative methods; ISDH; ISDHI; NP-hard problem; composite heuristic; double-job-insert-operator; flow shop benchmark; improved standard deviation heuristic; improved standard deviation heuristic-with-iteration; no-wait flow shop scheduling problem; total flow time criterion; Delay; Educational institutions; Job shop scheduling; Processor scheduling; Standards; Synchronous digital hierarchy; Constructive heuristic; Flow shop; No-wait; Total flow time; composite heuristic;
Conference_Titel :
Evolutionary Computation (CEC), 2012 IEEE Congress on
Conference_Location :
Brisbane, QLD
Print_ISBN :
978-1-4673-1510-4
Electronic_ISBN :
978-1-4673-1508-1
DOI :
10.1109/CEC.2012.6252932