A heuristic approach to minimising maximum lateness on a single machine
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...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Stellenbosch University
2015-11-01
|
Series: | South African Journal of Industrial Engineering |
Subjects: | |
Online Access: | http://sajie.journals.ac.za/pub/article/view/1030 |