A Quantum Inspired Algorithm for the Job Shop Scheduling Problem

摘要：

The classical job shop scheduling problem (JSP) is typically NP hard. A quantum inspired algorithm is proposed to solve the JSP. Firstly, the JSP is formulated. Secondly, the detail of the quantum inspired algorithm is designed, including the quantum chromosome encoding and decoding mechanism, the updating method with the rotation gate matrix. The elitist strategy is integrated to speed up the convergence. Finally, the experiment with the FT06 instance shows the effectiveness and efficiency of the proposed approach.

关键词： job shop scheduling problem quantum inspired algorithm elitist strategy

作者: XiuLi Wu SuJian Li

作者单位: School of Mechanical Engineering,University of Science and Technology Beijing,100083, Beijing, China

会议类型: 国际会议

会议名称: 2011 IEEE 2nd International Conference on Computing，Control and Industrial Engineering(CCIE 2011)(第二届计算、控制与工业工程国际会议)

会议地点: 武汉

会议语种:英文

页码: 212-215

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