.png){kind=icon}
Return
An Effective Iterated Greedy Algorithm for a Robust Distributed Permutation Flowshop Problem With Carryover Sequence-Dependent Setup Time
.png){kind=icon}
PRE
AI
DOI：10.1109/TSMC.2021.3131849.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A new scheduling problem, the distributed permutation flowshop scheduling problem with uncertain processing times and carryover sequence-dependent setup time (DPUC), is addressed. The DPUC is an important application problem in modern electronics manufacturing. A robust model is established for the DPUC with makespan criterion. A counter-intuitive paradox is found, that is, adding a new job to one of the production lines can reduce the completion time of the production line. Two acceleration methods are provided to save computational efforts. An iterated greedy algorithm called IG_FS is proposed to solve the DPUC. A heuristic based on the well-known NEH is proposed to generate the initial solution for the IG_FS. In the destruction phase of the IG_FS, dynamic sizes based on both adaptability and randomness are provided to improve the exploration capability. During the local search phase of the IG_FS, a hybrid local search method consisting of shift and swap operators is presented to exploit more diverse search areas. Extensive experiments show that the proposed IG_FS performs significantly better than the six competing algorithms adapted from the closely related scheduling literature.
Keywords:
Production
Job shop scheduling
Uncertainty
Single machine scheduling
Automation
Search methods
Optimization
Carryover sequence-dependent setup time (CST)
iterated greedy (IG) algorithm
scheduling
uncertain processing times (UPT)
Journal
IF:
10.5
Papers:
1.1W
Citations:
5.0W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveRobust makespan minimisation in identical parallel machine scheduling problem with interval data
PREAI
ShareSaveShareSaveShareSave
View more