Hybrid Tabu Search Algorithm for Unrelated Parallel Machine Scheduling in Semiconductor Fabs with Setup Times, Job Release, and Expired Times

2022 ◽  
pp. 107915
Author(s):  
Changyu Chen ◽  
Mahdi Fathi ◽  
Marzieh Khakifirooz ◽  
Kan Wu
Keyword(s):  
Tabu Search ◽  
Search Algorithm ◽  
Machine Scheduling ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Setup Times ◽  
Tabu Search Algorithm ◽  
Unrelated Parallel Machine ◽  
Unrelated Parallel Machine Scheduling

scholarly journals Sine-Cosine Algorithm to Enhance Simulated Annealing for Unrelated Parallel Machine Scheduling with Setup Times

Mathematics ◽  
2019 ◽  
Vol 7 (11) ◽  
pp. 1120 ◽  
Author(s):  
Hamza Jouhari ◽  
Deming Lei ◽  
Mohammed A. A. Al-qaness ◽  
Mohamed Abd Elaziz ◽  
Ahmed A. Ewees ◽  
...  
Keyword(s):  
Simulated Annealing ◽  
Machine Scheduling ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Setup Times ◽  
Unrelated Parallel Machine ◽  
Comparison Results ◽  
Unrelated Parallel Machine Scheduling ◽  
Sine Cosine Algorithm ◽  
Dependent Setup Times

This paper presents a hybrid method of Simulated Annealing (SA) algorithm and Sine Cosine Algorithm (SCA) to solve unrelated parallel machine scheduling problems (UPMSPs) with sequence-dependent and machine-dependent setup times. The proposed method, called SASCA, aims to improve the SA algorithm using the SCA as a local search method. The SCA provides a good tool for the SA to avoid getting stuck in a focal point and improving the convergence to an efficient solution. SASCA algorithm is used to solve UPMSPs by minimizing makespan. To evaluate the performance of SASCA, a set of experiments were performed using 30 tests for 4 problems. Moreover, the performance of the proposed method was compared with other meta-heuristic algorithms. The comparison results showed the superiority of SASCA over other methods in terms of performance dimensions.

Sign in / Sign up

Export Citation Format

Share Document