A Variant Iterated Greedy Algorithm Integrating Multiple Decoding Rules for Hybrid Blocking Flow Shop Scheduling Problem
This paper studies the hybrid flow shop scheduling problem with blocking constraints (BHFSP). To better understand the BHFSP, we will construct its mixed integer linear programming (MILP) model and use the Gurobi solver to demonstrate its correctness. Since the BHFSP exists parallel machines in some...
Main Authors: | Yong Wang, Yuting Wang, Yuyan Han |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2023-05-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/11/11/2453 |
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 Modified Iterated Greedy Algorithm for Flexible Job Shop Scheduling Problem
by: Ghiath Al Aqel, et al.
Published: (2019-03-01) -
A Penalty Groups-Assisted Iterated Greedy Integrating Idle Time Insertion: Solving the Hybrid Flow Shop Group Scheduling with Delivery Time Windows
by: Qianhui Ji, et al.
Published: (2024-06-01) -
An Iterated Greedy Algorithm for Solving the Blocking Flow Shop Scheduling Problem with Total Flow Time Criteria
by: Danial Khorasanian, et al.
Published: (2012-11-01) -
A Distributed Blocking Flowshop Scheduling with Setup Times Using Multi-Factory Collaboration Iterated Greedy Algorithm
by: Chenyao Zhang, et al.
Published: (2023-01-01)