Title :
Hybrid Heuristic for Total Flowtime Minimization in No-wait Flow Shops
Author :
Zhu, Xia ; Li, Xiaoping ; Wang, Qian
Author_Institution :
Southeast Univ., Nanjing
Abstract :
In this paper, no-wait flow shop scheduling problem with total flowtime minimization is considered. A hybrid heuristic is proposed, which is based on PHI (p) (presented by Aldowaisan and Allahverdi, OMEGA, 2004). A composite algorithm is adopted to generate the initial seed. Job insertion in PHI (p) is replaced with an existing constructive heuristic. Experimental results show that the proposal outperforms PHI (p), especially for large scale instances.
Keywords :
computational complexity; flow shop scheduling; heuristic programming; minimisation; no-wait flow shops scheduling problem; time complexity; total flowtime minimization; Chemical technology; Collaborative work; Computer networks; Design engineering; Job shop scheduling; Laboratories; Large-scale systems; Manufacturing; Processor scheduling; Proposals; flow-shop; heuristic scheduling; no-wait; total flowtime;
Conference_Titel :
Computer Supported Cooperative Work in Design, 2007. CSCWD 2007. 11th International Conference on
Conference_Location :
Melbourne, Vic.
Print_ISBN :
1-4244-0963-2
Electronic_ISBN :
1-4244-0963-2
DOI :
10.1109/CSCWD.2007.4281584
