Scheduling Hybrid Flow Shops by an Improved Memetic Algorithm

摘要：

　　This study is concerned about how to optimize the production sequences to minimize the makespan in hybrid flow shops with limited intermediate buffers.An improved memetic algorithm (IMA) is proposed for solving the NP-hard problem.In this algorithm,the method of generating the initial population,the local search procedures,the selection,crossover and mutation operators are newly designed.Optimization results are compared between the IMA and other three scheduling algorithms proposed in previous literature.Comparison results show that the IMA proposed in this paper is feasible and efficient for scheduling hybrid flow shops with limited intermediate buffers.

关键词： Scheduling Hybrid flow shop Buffer Memetic algorithm Makespan

作者: Wang Binggang

作者单位: Research Institute of Business Administration Henan University of Urban Construction Pingdingshan, China, 467044

会议类型: 国际会议

会议名称: 2012 2nd International Conference on Computer Application and System Modeling(2012第二届计算机应用与系统建模国际会议)(ICCASM-2012)

会议地点: 沈阳

会议语种:英文

页码: 822-824

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