HEURISTICS FOR MINIMIZING THE NUMBER OF TARDY JOBS ON A SINGLE MACHINE WITH RELEASE TIME

Authors

  • E. O. Oyetunji Department of Industrial and Production Engineering, University of Ibadan
  • A. E. Oluleye Department of Industrial and Production Engineering, University of Ibadan

DOI:

https://doi.org/10.7166/19-2-100

Abstract

ENGLISH ABSTRACT: This paper considers the problem of minimizing the number of tardy jobs with release time on a single machine. Given that the problem has been classified as strongly NP-Hard, three heuristics (EOO, HR2, and HR3) are proposed for this problem. They are compared with a heuristic by Dauzere-Perez (selected from the literature). Randomly-generated problems ranging from 3 to 500 jobs are solved. Experimental results show that one of the proposed heuristics (EOO) outperforms other heuristics, both in terms of quality of solution (effectiveness) and speed of execution (efficiency).

AFRIKAANSE OPSOMMING: Die navorsing behandel die ministering van voltooiingstyd van die aantal draaltake by

Downloads

Download data is not yet available.

Downloads

Published

2011-11-05

How to Cite

Oyetunji, E. O., & Oluleye, A. E. (2011). HEURISTICS FOR MINIMIZING THE NUMBER OF TARDY JOBS ON A SINGLE MACHINE WITH RELEASE TIME. The South African Journal of Industrial Engineering, 19(2). https://doi.org/10.7166/19-2-100

Issue

Section

General Articles