A Novel Shuffled Frog-Leaping Algorithm for Unrelated Parallel Machine Scheduling with Deteriorating Maintenance and Setup Time

Symmetry

Deming Lei¹  Tian Yi¹ 

[1] School of Automation, Wuhan University of Technology, Wuhan 430000, China;

关键词: shuffled frog-leaping algorithm;    sequence-dependent setup time;    preventive maintenance;    parallel machines;    scheduling;   

DOI  :  10.3390/sym13091574

来源: DOAJ

【 摘 要 】

Unrelated parallel machine scheduling problems (UPMSP) with various processing constraints have been considered fully; however, a UPMSP with deteriorating preventive maintenance (PM) and sequence-dependent setup time (SDST) is seldom considered. In this study, a new differentiated shuffled frog-leaping algorithm (DSFLA) is presented to solve the problem with makespan minimization. The whole search procedure consists of two phases. In the second phase, quality evaluation is done on each memeplex, then the differentiated search processes are implemented between good memeplexes and other ones, and a new population shuffling is proposed. We conducted a number of experiments. The computational results show that the main strategies of DSFLA were effective and reasonable and DSFLA was very competitive at solving UPMSP with deteriorating PM and SDST.

【 授权许可】

Unknown