DocumentCode
3132384
Title
A quantum inspired algorithm for the job shop scheduling problem
Author
Wu, XiuLi ; Li, Sujian
Author_Institution
Sch. of Mech. Eng., Univ. of Sci. & Technol. Beijing, Beijing, China
Volume
2
fYear
2011
fDate
20-21 Aug. 2011
Firstpage
212
Lastpage
215
Abstract
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.
Keywords
job shop scheduling; matrix algebra; optimisation; NP hard problem; job shop scheduling; quantum chromosome decoding; quantum chromosome encoding; quantum inspired algorithm; rotation gate matrix; Algorithm design and analysis; Biological cells; Decoding; Genetic algorithms; Job shop scheduling; Logic gates; Quantum computing; elitist strategy; job shop scheduling problem; quantum inspired algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Computing, Control and Industrial Engineering (CCIE), 2011 IEEE 2nd International Conference on
Conference_Location
Wuhan
Print_ISBN
978-1-4244-9599-3
Type
conf
DOI
10.1109/CCIENG.2011.6008104
Filename
6008104
Link To Document