COMMON DUE DATE ASSIGNMENT TO MINIMIZE TOTAL PENALTY FOR THE ONE MACHINE SCHEDULING PROBLEM.

S. S. Panwalkar, M. L. Smith, A. Seidmann

Research output: Contribution to journalArticlepeer-review

333 Scopus citations

Abstract

The authors consider an n job, one machine scheduling problem in which all jobs have a common due date. The objective is to determine the optimal value of this due date and an optimal sequence to minimize a total penalty function. This penalty function is based on the due date value and on the earliness or the lateness of each job in the selected sequence. A presentation is made of a polynomial bound scheduling algorithm for the solution of this problem along with the proof of optimality, a numerical example and discuss some extensions.

Original languageEnglish
Pages (from-to)391-399
Number of pages9
JournalOperations Research
Volume30
Issue number2
DOIs
StatePublished - 1982

Fingerprint Dive into the research topics of 'COMMON DUE DATE ASSIGNMENT TO MINIMIZE TOTAL PENALTY FOR THE ONE MACHINE SCHEDULING PROBLEM.'. Together they form a unique fingerprint.

Cite this