Modified Harmony Search Algorithm for Resource-Constrained Parallel Machine Scheduling Problem with Release Dates and Sequence-Dependent Setup Times

• Published in: Processes Vol. 9; no. 4; p. 654
• Main Authors: Al-harkan, Ibrahim M., Qamhan, Ammar A., Badwelan, Ahmed, Alsamhan, Ali, Hidri, Lotfi
• Format: Journal Article
• Language: English
• Published: Basel MDPI AG 01.04.2021
• Subjects: Algorithms; Completion time; Computer applications; Constraints; Factorial analysis; Genetic algorithms; Heuristic; Integer programming; Job shops; Linear programming; Manufacturing; Mathematical programming; Parameter modification; Parameter sensitivity; Release dates; Renewable resources; Resource scheduling; Scheduling; Search algorithms; Sensitivity analysis; Setup times
• ISSN: 2227-9717; 2227-9717
• DOI: 10.3390/pr9040654

This research focuses on the problem of scheduling a set of jobs on unrelated parallel machines subject to release dates, sequence-dependent setup times, and additional renewable resource constraints. The objective is to minimize the maximum completion time (makespan). To optimize the problem, a modified harmony search (MHS) algorithm was proposed. The parameters of MHS are regulated using full factorial analysis. The MHS algorithm is examined, evaluated, and compared to the best methods known in the literature. Four algorithms were represented from similar works in the literature. A benchmark instance has been established to test the sensitivity and behavior of the problem parameters of the different algorithms. The computational results of the MHS algorithm were compared with those of other metaheuristics. The competitive performance of the developed algorithm is verified, and it was shown to provide a 42% better solution than the others.