摘要
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.
学科与关键词
- Solving distributed two-stage hybrid flowshop scheduling using a shuffled frog-leaping algorithm with memeplex groupingLei, Deming*; Wang, TianENGINEERING OPTIMIZATION, 2020, 52(9): 1461-1474.被引 62
- A shuffled frog-leaping algorithm with memeplex quality for bi-objective distributed scheduling in hybrid flow shopCai, Jingcao; Lei, Deming*; Li, MingInternational Journal of Production Research, 2021, 59(18): 5404-5421.被引 50
- Scheduling unrelated parallel machines with preventive maintenance and setup time: Multi-sub-colony artificial bee colonyLei, Deming*; Yang, HaiAPPLIED SOFT COMPUTING, 2022, 125: 109154.被引 14
