COMPARING THE PERFORMANCE OF DIFFERENT META-HEURISTICS FOR UNWEIGHTED PARALLEL MACHINE SCHEDULING
DOI:
https://doi.org/10.7166/26-2-628Keywords:
Parallel Machine, Heuristics, Just-In-Time, Meta-heuristic, NP CompleteAbstract
This article considers the due window scheduling problem to minimise the number of early and tardy jobs on identical parallel machines. This problem is known to be NP complete and thus finding an optimal solution is unlikely. Three meta-heuristics and their hybrids are proposed and extensive computational experiments are conducted. The purpose of this paper is to compare the performance of these meta-heuristics and their hybrids and to determine the best among them. Detailed comparative tests have also been conducted to analyse the different heuristics with the simulated annealing hybrid giving the best result.
Downloads
Download data is not yet available.
Downloads
Published
2015-08-03
How to Cite
Adamu, M. O., & Adewumi, A. (2015). COMPARING THE PERFORMANCE OF DIFFERENT META-HEURISTICS FOR UNWEIGHTED PARALLEL MACHINE SCHEDULING. The South African Journal of Industrial Engineering, 26(2), 143–157. https://doi.org/10.7166/26-2-628
Issue
Section
General Articles
License
Authors who publish in the Journal agree to the following terms:- Authors retain copyright and grant the Journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this Journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the Journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this Journal.