A quantum‐inspired cuckoo co‐evolutionary algorithm for no‐wait flow shop scheduling
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 ev...
Main Authors: | Haihong Zhu, Ning Luo, Xiaoping Li |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2021-06-01
|
Series: | IET Collaborative Intelligent Manufacturing |
Subjects: | |
Online Access: | https://doi.org/10.1049/cim2.12002 |
Similar Items
-
Improved discrete cuckoo‐search algorithm for mixed no‐idle permutation flow shop scheduling with consideration of energy consumption
by: Lingchong Zhong, et al.
Published: (2021-12-01) -
A TABU SEARCH APPROACH FOR PERMUTATION FLOW SHOP SCHEDULING
by: Cristina Elena DODU, et al.
Published: (2020-06-01) -
<b>Evolutionary heuristic for makespan minimization in no-idle flow shop production systems</b> - doi: 10.4025/actascitechnol.v35i2.12534
by: Marcelo Seido Nagano, et al.
Published: (2013-04-01) -
A Hybrid Discrete Memetic Algorithm for Solving Flow-Shop Scheduling Problems
by: Levente Fazekas, et al.
Published: (2023-08-01) -
Solving the Distributed Permutation Flow-Shop Scheduling Problem Using Constrained Programming
by: Christos Gogos
Published: (2023-11-01)