A HEURISTIC APPROACH TO MINIMISING MAXIMUM LATENESS ON A SINGLE MACHINE

Calis B., Bulkan S., Tuncer F.

SOUTH AFRICAN JOURNAL OF INDUSTRIAL ENGINEERING, cilt.26, sa.3, ss.41-53, 2015 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 26 Sayı: 3
  • Basım Tarihi: 2015
  • Doi Numarası: 10.7166/26-3-1030
  • Dergi Adı: SOUTH AFRICAN JOURNAL OF INDUSTRIAL ENGINEERING
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.41-53
  • Marmara Üniversitesi Adresli: Evet

Özet

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.