A Distributed Blocking Flowshop Scheduling with Setup Times Using Multi-Factory Collaboration Iterated Greedy Algorithm
As multi-factory production models are more widespread in modern manufacturing systems, a distributed blocking flowshop scheduling problem (DBFSP) is studied in which no buffer between adjacent machines and setup time constraints are considered. To address the above problem, a mixed integer linear p...
Main Authors: | Chenyao Zhang, Yuyan Han, Yuting Wang, Junqing Li, Kaizhou Gao |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2023-01-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/11/3/581 |
Similar Items
-
Intelligent Optimization Under Multiple Factories: Hybrid FlowShop Scheduling Problem with Blocking ConstraintsUsing an Advanced Iterated Greedy Algorithm
by: Yong Wang, et al.
Published: (2023-12-01) -
A Variant Iterated Greedy Algorithm Integrating Multiple Decoding Rules for Hybrid Blocking Flow Shop Scheduling Problem
by: Yong Wang, et al.
Published: (2023-05-01) -
Effective Design of the Simulated Annealing Algorithm for the Flowshop Problem with Minimum Makespan Criterion
by: Jarosław Hurkała, et al.
Published: (2012-06-01) -
A Variable Block Insertion Heuristic for the Blocking Flowshop Scheduling Problem with Total Flowtime Criterion
by: Pan, Quan-Ke, et al.
Published: (2016) -
Two NEH Heuristic Improvements for Flowshop Scheduling Problem with Makespan Criterion
by: Christophe Sauvey, et al.
Published: (2020-04-01)