SciELO - Scientific Electronic Library Online

 
vol.21 issue2Pareto optimal solutions for multi-objective generalized assignment problemDemand categorisation, forecasting, and inventory control for intermittent demand items author indexsubject indexarticles search
Home Pagealphabetic serial listing  

Services on Demand

Article

Indicators

Related links

  • On index processCited by Google
  • On index processSimilars in Google

Share


South African Journal of Industrial Engineering

On-line version ISSN 2224-7890
Print version ISSN 1012-277X

Abstract

OYETUNJI, E. O.  and  OLULEYE, A. E.. New heuristics for minimising total completion time and the number of tardy jobs criteria on a single machine with release time. S. Afr. J. Ind. Eng. [online]. 2010, vol.21, n.2, pp.101-114. ISSN 2224-7890.

This paper considers the bi-criteria scheduling problem of simultaneously minimising the total completion time and the number of tardy jobs with release dates on a single machine. Since the problem had been classified as Np-Hard, two heuristics (HR9 and HR10) were proposed for solving this problem. Performance evaluations of the proposed heuristics and selected solution methods (HR7 and BB) from the literature were carried out on 1,100 randomly generated problems ranging from 3 to 500 jobs. Experiment results show that HR7 outperformed HR10 when the number of jobs (n) is less than 30, while HR10 outperformed HR7 for n≥ 30.

        · abstract in Afrikaans     · text in English     · English ( pdf )

 

Creative Commons License All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License