A cooperative adaptive genetic algorithm for reentrant hybrid flow shop scheduling with sequence-dependent setup time and limited buffers

A cooperative adaptive genetic algorithm for reentrant hybrid flow shop scheduling with sequence-dependent setup time and limited buffers

Abstract This paper deals with a reentrant hybrid flow shop problem with sequence-dependent setup time and limited buffers where there are multiple unrelated parallel machines at each stage. A mathematical model with the minimization of total weighted completion time is constructed for this problem....

Full description

Bibliographic Details
Main Authors: Qianqian Zheng, Yu Zhang, Hongwei Tian, Lijun He
Format: Article
Language:English
Published: Springer 2023-08-01
Series:Complex & Intelligent Systems
Subjects:
Reentrant hybrid flow shop
Sequence-dependent setup time
Limited buffers
Unrelated parallel machines
Total weighted completion time
Cooperative adaptive genetic algorithm
Online Access:https://doi.org/10.1007/s40747-023-01147-8

Internet

https://doi.org/10.1007/s40747-023-01147-8

Similar Items