Hybrid genetic algorithms with dispatching rules for unrelated parallel machine scheduling with setup time and production availability

2015 ◽  
Vol 85 ◽  
pp. 102-109 ◽  
Author(s):  
Cheol Min Joo ◽  
Byung Soo Kim
Keyword(s):  
Genetic Algorithms ◽  
Machine Scheduling ◽  
Setup Time ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Dispatching Rules ◽  
Unrelated Parallel Machine ◽  
Hybrid Genetic Algorithms ◽  
Unrelated Parallel Machine Scheduling

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

Symmetry ◽  
2021 ◽  
Vol 13 (9) ◽  
pp. 1574
Author(s):  
Deming Lei ◽  
Tian Yi
Keyword(s):  
Machine Scheduling ◽  
Setup Time ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Second Phase ◽  
Scheduling Problems ◽  
Shuffled Frog Leaping Algorithm ◽  
Unrelated Parallel Machine ◽  
Unrelated Parallel Machine Scheduling ◽  
Shuffled Frog Leaping

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.

Sign in / Sign up

Export Citation Format

Share Document