Resumo

CALIş, B.; BULKAN, S.  e  TURCER, F.. A heuristic approach to minimising maximum lateness on a single machine. S. Afr. J. Ind. Eng. [online]. 2015, vol.26, n.3, pp.41-53. ISSN 2224-7890.  http://dx.doi.org/10.7166/26-3-1030.

This paper focuses on the problem of scheduling on a single machine to minimise the maximum lateness when each job has a different ready time, processing time, and due date. A simple procedure is developed to find a better solution than the early due date (EDD) algorithm. The new algorithm suggested in this paper is called Least Slack Time -Look Ahead (LST-LA), which minimises the maximum lateness problem. Computational results show that when the number of jobs increases, LST-LA outperforms EDD.

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