International Journal of
Physical Sciences

  • Abbreviation: Int. J. Phys. Sci.
  • Language: English
  • ISSN: 1992-1950
  • DOI: 10.5897/IJPS
  • Start Year: 2006
  • Published Articles: 2557

Full Length Research Paper

Metaheuristics for scheduling on parallel machine to minimize weighted number of early and tardy jobs

M. O. Adamu1 and A. O. Adewumi2*      
1Department of Mathematics, University of Lagos, Lagos, Nigeria. 2School of Mathematics, Statistics and Computer Science, University of KwaZulu-Natal, Durban, South Africa.  
Email: [email protected]

  •  Accepted: 26 January 2012
  •  Published: 02 March 2012


This paper considers the scheduling of n jobs on m parallel machines to minimize the weighted number of early and tardy jobs. The single machine case of this problem has been shown to be NP- complete in the strong sense. This problem on m parallel machineis also NP complete in the strong sense and finding an optimal solution appears unlikely. The problem is formulated as an integer linear programming model. In this paper, we propose some meta-heuristics for solving this problem. Extensive computational experiments were performed which gave promising results.


Key words: Scheduling, parallel machine, heuristics, metaheuristics, particle swarm optimization, genetic algorithm, simulated annealing, hybrid.