Sine-cosine algorithm to enhance simulated annealing for unrelated parallel machine scheduling with setup times

41Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

Jouhari, H., Lei, D., Al-qaness, M. A. A., Elaziz, M. A., Ewees, A. A., & Farouk, O. (2019). Sine-cosine algorithm to enhance simulated annealing for unrelated parallel machine scheduling with setup times. Mathematics, 7(11). https://doi.org/10.3390/math7111120

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free