COMPARING THE PERFORMANCE OF DIFFERENT META-HEURISTICS FOR UNWEIGHTED PARALLEL MACHINE SCHEDULING

Authors

  • Mumuni Osumah Adamu UNIVERSITY OF LAGOS
  • Aderemi Adewumi UNIVERSITY OF KWAZULU-NATAL

DOI:

https://doi.org/10.7166/26-2-628

Keywords:

Parallel Machine, Heuristics, Just-In-Time, Meta-heuristic, NP Complete

Abstract

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.

Author Biography

Aderemi Adewumi, UNIVERSITY OF KWAZULU-NATAL

SCHOOL OF MATHEMATICS, STATISTICS AND COMPUTER SCIENCE

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