Resumo

OYETUNJI, E. O.  e  OLULEYE, A. E.. Heuristics for minimizing the number of tardy jobs on a single machine with release time. S. Afr. J. Ind. Eng. [online]. 2008, vol.19, n.2, pp.183-196. ISSN 2224-7890.

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).

        · resumo em Africaner     · texto em Inglês     · Inglês ( pdf )