Journal of
Engineering and Technology Research

  • Abbreviation: J. Eng. Technol. Res.
  • Language: English
  • ISSN: 2006-9790
  • DOI: 10.5897/JETR
  • Start Year: 2009
  • Published Articles: 183

Full Length Research Paper

A comparative study of meta-heuristics for identical parallel machines

M.O. Adamu
  • M.O. Adamu
  • Department of Mathematics, University of Lagos, Lagos, Nigeria.
  • Google Scholar
A. Adewunmi
  • A. Adewunmi
  • School of Computer Science, University of Kwazulu-Natal, Durban, South Africa.
  • Google Scholar

  •  Accepted: 15 February 2013
  •  Published: 30 September 2013



This paper considers the scheduling problem of minimizing the weighted number of early and tardy jobs on identical parallel machines, Pm||∑wj(Uj + Vj). This problem is known to be NP complete and finding an optimal solution is unlikely. Six meta-heuristics including hybrids are proposed for solving the problem. The meta-heuristics considered are genetic algorithm, particle swarm optimization and simulated annealing with their hybrids. A comparative study that involves computational experiments and statistical analysis are presented evaluating these algorithms. The results of the research are very promising.


Key words: Parallel machine, heuristics, just-in-time, meta-heuristics, NP-complete.