Title :
A new heuristic method combined with Lagrangian relaxation algorithm for Hybrid flow shop problem
Author :
Zhou, Xuanhao ; Lu, Yong-Zai
Author_Institution :
State Key Lab. of Ind. Control Technol., Zhejiang Univ., Hangzhou, China
Abstract :
In this paper, a heuristic algorithm which embedded in the Lagrangian relaxation algorithm is proposed to obtain the near optimal solution to minimize the total weighted complete time in the Hybrid flow shop problem (HFS). Compared with the original precedence capacity relaxation algorithm proposed by Tang et al., our algorithm can produce a better solution in most cases.
Keywords :
flow shop scheduling; minimisation; relaxation theory; Lagrangian relaxation; heuristic algorithm; hybrid flow shop problem; total weighted complete time minimization; Dynamic programming; Heuristic algorithms; Job shop scheduling; Mathematical model; Parallel machines; Processor scheduling; Lagrangian relaxation; due date; heuristic; hybrid flow shop; release time;
Conference_Titel :
Industrial Engineering and Engineering Management (IEEM), 2010 IEEE International Conference on
Conference_Location :
Macao
Print_ISBN :
978-1-4244-8501-7
Electronic_ISBN :
2157-3611
DOI :
10.1109/IEEM.2010.5674388
