Improved discrete cuckoo‐search algorithm for mixed no‐idle permutation flow shop scheduling with consideration of energy consumption

Improved discrete cuckoo‐search algorithm for mixed no‐idle permutation flow shop scheduling with consideration of energy consumption

Abstract The increasing number and types of industrial tasks require factories to be more flexible in production. An improved discrete cuckoo search algorithm (CSA) is proposed and used to optimise the mixed no‐idle permutation flow shop scheduling problem (MNPFSP). This problem considers MNPFSP ene...

Full description

Bibliographic Details
Main Authors: Lingchong Zhong, Wenfeng Li, Bin Qian, Lijun He
Format: Article
Language:English
Published: Wiley 2021-12-01
Series:IET Collaborative Intelligent Manufacturing
Subjects:
optimisation
search problems
computational complexity
entropy
flow shop scheduling
Online Access:https://doi.org/10.1049/cim2.12025

Internet

https://doi.org/10.1049/cim2.12025

Similar Items