n South African Journal of Industrial Engineering - A heuristic approach to minimising maximum lateness on a single machine

Volume 26, Issue 3
  • ISSN : 1012-277X



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.

Die artikel konsentreer op die skedulering van 'n enkele masjien om die maksimum laatwees probleem, wanneer elke taak 'n verskillende gereedheidstyd, prosesseertyd en keerdatum het, te minimeer. 'n Eenvoudige prosedure om 'n beter oplossing tot die vroeë keerdatum algoritme te bepaal, is ontwikkel. Die nuwe algoritme word die "Least Slack Time Look Ahead" genoem en dit minimiseer die maksimum laatwees probleem. Simulasie resultate toon dat soos die aantal take toeneem, vertoon die nuwe algoritme beter as die vroeë keerdatum algoritme.

Loading full text...

Full text loading...


Article metrics loading...


This is a required field
Please enter a valid email address
Approval was a Success
Invalid data
An Error Occurred
Approval was partially successful, following selected items could not be processed due to error