Abstract
No-wait flow shop scheduling problems (NWFSPs) are widespread in practical applications. The authors propose a quantum-inspired cuckoo co-evolutionary algorithm for the NWFSP to minimize the makespan. There are three algorithm components: quantum solution construction, quantum population evolution, and an improved neighbourhood local search. They generate initial solutions, search solutions, and improve solution qualities, respectively. Parameters of the proposed algorithm are calibrated statistically. The proposal with calibrated parameters is compared with three existing algorithms on Reeves and Taillard benchmark instances with middle scales. Experimental results show that the proposal outperforms the compared algorithms.
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 callDisclaimer: 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.
