.png){kind=icon}
Return
An iterated greedy algorithm for the parallel blocking flow shop scheduling problem and sequence-dependent setup times
.png){kind=icon}
OA
AI
DOI：10.1016/j.eswa.2021.115535.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper deals with the problem of scheduling jobs in a parallel flow shop configuration under the blocking constraint, in which the setup time of machines depends not only on the job to be processed but also on the previously processed one, i.e., there are sequence-dependent setup times. The performance analysis of several iterated greedy algorithms with different initial solution procedures and local searches lets us define an efficient algorithm to minimize the maximum job completion time. Moreover, the computational evaluation showed the efficiency of searching in different neighborhood structures and noted the significant influence of the initial solution. However, contrary to other scheduling problems, starting with a high quality solution does not guarantee better performance of the algorithm.
Keywords:
Parallel Flow Shop
Sequence-dependent Setup times
Makespan
Distributed Flow Shop
Blocking
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.5
Papers:
3.0W
Citations:
10.2W
Organization
Cited Papers
ShareSaveScheduling algorithms for remanufacturing systems with parallel flow-shop-type reprocessing lines
PREAI
ShareSaveUltra-Stretchable, Adhesive, Conductive, and Antifreezing Multinetwork Borate Ester-Based Hydrogel for Wearable Strain Sensor and VOC Absorption.png)
ACS Sensors
ACS SensorsIF0
PREAI
ShareSaveShareSave
View more