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.

scholarly journals Modified Harris Hawks Optimizer for Solving Machine Scheduling Problems

Symmetry ◽  
2020 ◽  
Vol 12 (9) ◽  
pp. 1460
Author(s):  
Hamza Jouhari ◽  
Deming Lei ◽  
Mohammed A. A. Al-qaness ◽  
Mohamed Abd Elaziz ◽  
Robertas Damaševičius ◽  
...  
Keyword(s):  
Computation Time ◽  
Machine Scheduling ◽  
Setup Time ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Scheduling Problems ◽  
Large Problem ◽  
Unrelated Parallel Machine Scheduling ◽  
Problem Instances ◽  
Machine Scheduling Problems

Scheduling can be described as a decision-making process. It is applied in various applications, such as manufacturing, airports, and information processing systems. More so, the presence of symmetry is common in certain types of scheduling problems. There are three types of parallel machine scheduling problems (PMSP): uniform, identical, and unrelated parallel machine scheduling problems (UPMSPs). Recently, UPMSPs with setup time had attracted more attention due to its applications in different industries and services. In this study, we present an efficient method to address the UPMSPs while using a modified harris hawks optimizer (HHO). The new method, called MHHO, uses the salp swarm algorithm (SSA) as a local search for HHO in order to enhance its performance and to decrease its computation time. To test the performance of MHHO, several experiments are implemented using small and large problem instances. Moreover, the proposed method is compared to several state-of-art approaches used for UPMSPs. The MHHO shows better performance in both small and large problem cases.

Sign in / Sign up

Export Citation Format

Share Document