Comparing the performance of different meta-heuristics for unweighted parallel machine scheduling

Comparing the performance of different meta-heuristics for unweighted parallel machine scheduling

Blog Article

This article considers the due window scheduling problem to minimise the number of early and tardy jobs on identical Dab Inserts 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 click here 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.