A HYBRID LOCAL SEARCH ALGORITHM FOR NO-WAIT FLOWSHOP SCHEDULING PROBLEM

摘要：

This paper presents a hybrid heuristic algorithm for no-wait flowshop scheduling problem, the goal of the heuristic is to minimize the makespan. Firstly, the algorithm produce the initial schedule with job pair compar ison algorithm and greed insert algorithm, then the initial schedule is optimized using the hybrid local search algorithm. The proposed algorithms are evaluated with 23 benchmark instances and found to be relatively more effective in finding better solutions than existed algorithms.

关键词： No-wait flowshop Job pair comparison Greed insert algorithm Local search

作者: Jing Wang Tieke Li Wenxue Zhang

作者单位: School of Economics and Management University of Science and Technology Beijing, 100083, China Schoo School of Economics and Management University of Science and Technology Beijing, 100083, China

会议类型: 国际会议

会议名称: The Ninth International Conference on Industrial Management(第九届工业管理国际会议 ICIM2008)

会议地点: 日本大阪

会议语种:英文

页码: 157-163

在线出版日期: 2008-09-16（万方平台首次上网日期，不代表论文的发表时间）