Abstract
For the purpose of solving the dynamic flexible job-shop scheduling problem, this paper establishes the mathematical model to minimize the makespan and stability value, an improved double chains quantum genetic algorithm was proposed. Firstly, it is proposed that the method of double chains structure coding including machine allocation chain and process chain. Secondly, it is proposed that non- dominated sorting based on the crowding distance selection strategy. Thirdly, the most satisfying solution is obtained through the multi-attribute grey target decision model. Finally, the novel method is applied to the Brandimarte example and a dynamic simulation, the result of comparing with other classical algorithms verifies its effectiveness.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Ambient Intelligence and Humanized Computing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
