Genetic Algorithm Design and Simulation for Job-shop Scheduling Problem

摘要：

This paper proposes an effective genetic algorithm for the job-shop scheduling problem (JSP) to minimize makespan time. An effective chromosome representation based on real coding is used to conveniently represent a solution of the JSP, and different strategies for selection, crossover and mutation are adopted. Simulation experimental results have shown that the scheduling model using the algorithm can allocate jobs efficiently and effectively.

关键词： job-shop scheduling problem genetic algorithm simulation

作者: Gui Cong Wang Xi Jie Tian Chuan Peng LI Na Na Yang

作者单位: School of Mechanical Engineering, University of Jinan, Jinan 250022, PR China

会议类型: 国际会议

会议名称: 2011 International Conference on Mechatronics and Applied Mechanics(2011年机电一体化与应用力学国际会议 ICMAM 2011)

会议地点: 香港

会议语种:英文

页码: 1436-1440

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