1887

n South African Journal of Industrial Engineering - Comparing the performance of different meta-heuristics for unweighted parallel machine scheduling

USD

 

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.

Die minimering van vroeë en trae take op identiese parallelle masjien met behulp van die gepaste gleufskeduleringsprobleem word oorweeg. Die probleem is nie-deterministies polinomiese tyd volledig en die vind van 'n optimale oplossing is dus onwaarskynlik. Drie meta-heuristieke en hul hibriede word voorgestel en uitgebreide berekeningseksperimente word uitgevoer. Die doel van hierdie artikel is om die vertoning van hierdie meta-heuristieke en hul hibriede met mekaar te vergelyk om sodoende die beste te identifiseer. Gedetaileerde vergelykende toetse is ook uitgevoer om die verskillende heuristieke te ondersoek; daar is gevind dat die gesimuleerde uitgloei hibried die beste resultaat lewer.

Loading

Article metrics loading...

/content/indeng/26/2/EJC177839
2015-08-01
2016-12-02
This is a required field
Please enter a valid email address
Approval was a Success
Invalid data
An Error Occurred
Approval was partially successful, following selected items could not be processed due to error