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....
Main Authors: | Qianqian Zheng, Yu Zhang, Hongwei Tian, Lijun He |
---|---|
Format: | Article |
Language: | English |
Published: |
Springer
2023-08-01
|
Series: | Complex & Intelligent Systems |
Subjects: | |
Online Access: | https://doi.org/10.1007/s40747-023-01147-8 |
Similar Items
-
Agent Scheduling in Unrelated Parallel Machines with Sequence- and Agent–Machine–Dependent Setup Time Problem
by: Jesús Isaac Vázquez-Serrano, et al.
Published: (2021-11-01) -
Evaluating the performance of constructive heuristics for the blocking flow shop scheduling problem with setup times
by: Mauricio Iwama Takano, et al.
Published: (2019-01-01) -
Multi-Objective Hybrid Flow-Shop Scheduling in Parallel Sequential Mode While Considering Handling Time and Setup Time
by: Yingjie Feng, et al.
Published: (2023-03-01) -
An Enhanced Adaptive Large Neighborhood Search for Unrelated Parallel Machine Scheduling With Sequence Dependent Setup Times
by: Bin Ji, et al.
Published: (2023-01-01) -
Green Hybrid Flow Shop Scheduling Problem Considering Sequence Dependent Setup Times and Transportation Times
by: Shaoxing Wu, et al.
Published: (2023-01-01)