Publication:
A HEURISTIC APPROACH TO MINIMISING MAXIMUM LATENESS ON A SINGLE MACHINE

Simple item page
dc.contributor.authorÇALIŞ USLU, BANU
dc.contributor.authorBULKAN, SEROL
dc.contributor.authorsCalis, B.; Bulkan, S.; Tuncer, F.
dc.date.accessioned2022-03-14T10:58:04Z
dc.date.accessioned2026-01-11T08:11:26Z
dc.date.available2022-03-14T10:58:04Z
dc.date.issued2015-11-30
dc.description.abstractThis 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.
dc.identifier.doi10.7166/26-3-1030
dc.identifier.issn2224-7890
dc.identifier.urihttps://hdl.handle.net/11424/245619
dc.identifier.wosWOS:000370745400005
dc.language.isoeng
dc.publisherSOUTHERN AFRICAN INST INDUSTRIAL ENGINEERING
dc.relation.ispartofSOUTH AFRICAN JOURNAL OF INDUSTRIAL ENGINEERING
dc.rightsinfo:eu-repo/semantics/openAccess
dc.subjectTARDY JOBS
dc.subjectNUMBER
dc.subjectDATES
dc.subjectTIMES
dc.titleA HEURISTIC APPROACH TO MINIMISING MAXIMUM LATENESS ON A SINGLE MACHINE
dc.typearticle
dspace.entity.typePublication
oaire.citation.endPage53
oaire.citation.issue3
oaire.citation.startPage41
oaire.citation.titleSOUTH AFRICAN JOURNAL OF INDUSTRIAL ENGINEERING
oaire.citation.volume26

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
file.pdf
Size:
413.62 KB
Format:
Adobe Portable Document Format
Download

Collections

Araştırma Çıktıları