NOTE ON MINIMIZING THE AVERAGE DEVIATION OF JOB COMPLETION TIMES ABOUT A COMMON DUE-DATE.

Research output: Journal article publicationJournal articleAcademic researchpeer-review

Abstract

This paper treats the problem of sequencing n jobs on a single machine with penalties occurring when a job is completed early or late. The objective is to minimize the total penalty. The penalty function has the same form as that assumed in a previous paper by J. J. 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)87-89
Number of pages3
JournalIndustrial Mathematics
Volume36
Issue numberpt 1
Publication statusPublished - 1 Dec 1986
Externally publishedYes

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering
  • Applied Mathematics

Cite this