Minimizing the average deviation of job completion times about a common due-date: An extension

Research output: Journal article publicationJournal articleAcademic researchpeer-review

12 Citations (Scopus)

Abstract

This paper treats the same problem as considered by Kanet [Nav. Res. Logist. Q. 28, 643-651 (1981)] about sequencing n jobs on a single machine with penalties occuring when a job is completed early or late. The objective is to minimize the total penalty. The penalty function has the same form as assumed by Kanet, but the restrictive assumption on the due-dates is relaxed. The result is that the quoted common due-date is reduced, while the efficient algorithm proposed by Kanet can still be used to help determine the optimal job sequence.
Original languageEnglish
Pages (from-to)13-15
Number of pages3
JournalMathematical Modelling
Volume9
Issue number1
DOIs
Publication statusPublished - 1 Jan 1987
Externally publishedYes

ASJC Scopus subject areas

  • Mathematics(all)

Cite this