Please use this identifier to cite or link to this item:
|Title:||A composite heuristic for the no-wait flow shop scheduling||Authors:||Gao, Kaizhou
Suganthan, P. N.
|Keywords:||DRNTU::Engineering::Electrical and electronic engineering||Issue Date:||2012||Source:||Gao, K., Suganthan, P. N., & Bao, Z. (2012). A composite heuristic for the no-wait flow shop scheduling. 2012 IEEE Congress on Evolutionary Computation (CEC).||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.||URI:||https://hdl.handle.net/10356/96842
|DOI:||http://dx.doi.org/10.1109/CEC.2012.6252932||Rights:||© 2012 IEEE.||Fulltext Permission:||none||Fulltext Availability:||No Fulltext|
|Appears in Collections:||EEE Conference Papers|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.