An Iterated Greedy Algorithm for a Parallel Machine Scheduling Problem with Re-entrant and Group Processing Features
This research paper addresses a novel parallel machine scheduling problem with re-entrant and group processing features, specifically motivated by the hot milling process in the modern steel manufacturing industry. The objective is to minimize the makespan. As no existing literature exists on this p...
Main Authors: | Shuaipeng Yuan, Bailin Wang, Tike Li |
---|---|
Format: | Article |
Language: | English |
Published: |
Faculty of Mechanical Engineering in Slavonski Brod, Faculty of Electrical Engineering in Osijek, Faculty of Civil Engineering in Osijek
2023-01-01
|
Series: | Tehnički Vjesnik |
Subjects: | |
Online Access: | https://hrcak.srce.hr/file/440445 |
Similar Items
-
Heuristic algorithms for two-machine re-entrant flowshop scheduling problem with jobs of two classes
by: BongJoo JEONG, et al.
Published: (2017-12-01) -
Sequence- and Time-Dependent Maintenance Scheduling in Twice Re-Entrant Flow Shops
by: Eghonghon-Aye Eigbe, et al.
Published: (2023-01-01) -
A Modified Iterated Greedy Algorithm for Flexible Job Shop Scheduling Problem
by: Ghiath Al Aqel, et al.
Published: (2019-03-01) -
Weighted Multi-Skill Resource Constrained Project Scheduling: A Greedy and Parallel Scheduling Approach
by: Saeed Akbar, et al.
Published: (2024-01-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)