A quantum inspired algorithm for the job shop scheduling problem
Xiuli Wu, Sujian Li · 2011
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.