A HEURISTIC APPROACH TO MINIMISING MAXIMUM LATENESS ON A SINGLE MACHINE

Authors

  • Banu Calis Marmara University
  • Serol Bulkan Marmara University
  • Ferit Tuncer Marmara University

DOI:

https://doi.org/10.7166/26-3-1030

Keywords:

Single Machine, Scheduling, Maximum Lateness

Abstract

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.

Author Biographies

Banu Calis, Marmara University

Department of Industrial Engineering

Serol Bulkan, Marmara University

Department of Industrial Engineering

Ferit Tuncer, Marmara University

Department of Computer Engineering

Downloads

Published

2015-11-30

How to Cite

Calis, B., Bulkan, S., & Tuncer, F. (2015). A HEURISTIC APPROACH TO MINIMISING MAXIMUM LATENESS ON A SINGLE MACHINE. The South African Journal of Industrial Engineering, 26(3), 41–53. https://doi.org/10.7166/26-3-1030

Issue

Vol. 26 No. 3 (2015)

Section

General Articles

License

Authors who publish in the Journal agree to the following terms:
  1. Authors retain copyright and grant the Journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this Journal.
  2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the Journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this Journal.