Title :
A heuristic for the no-wait flow shop scheduling optimization
Author :
Sun, Q.Q. ; Gao, K.Z. ; Li, H.Q.
Author_Institution :
Dept. of Comput. Sci. & Technol., Binzhou Univ., Binzhou, China
Abstract :
This paper proposed a new heuristic, named SDH heuristic, for solving the no-wait flow shop scheduling problem with the objective to minimize total flowtime. The SDH heuristic is based on the well-known NEH heuristic Firstly, the total flowtime is shown. Secondly, the SDH heuristic is presented. Thirdly, Extensive computational experiments are carried out based on a set of well-known benchmark instances. Computational results and comparison show the effectiveness of the DHS heuristic in solving the no-wait flow shop scheduling with total flowtime criterion.
Keywords :
flow shop scheduling; optimisation; NEH heuristic; SDH heuristic; no-wait flow shop scheduling optimization; Benchmark testing; Computer science; Europe; Heuristic algorithms; Job shop scheduling; Processor scheduling; Synchronous digital hierarchy; SDH heuristic; flow shop scheduling; no-wait; total flowtime;
Conference_Titel :
Computing, Control and Industrial Engineering (CCIE), 2011 IEEE 2nd International Conference on
Conference_Location :
Wuhan
Print_ISBN :
978-1-4244-9599-3
DOI :
10.1109/CCIENG.2011.6007990
