Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem

S. S. Panwalkar, M. L. Smith and A. Seidmann
Additional contact information
S. S. Panwalkar: Texas Tech University, Lubbock, Texas
M. L. Smith: Texas Tech University, Lubbock, Texas
A. Seidmann: Tel Aviv University, Tel Aviv, Israel

Operations Research, 1982, vol. 30, issue 2, 391-399

Abstract: We 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. We present a polynomial bound scheduling algorithm for the solution of this problem along with the proof of optimality, a numerical example and discuss some extensions.

Keywords: 581; optimal; due-date; assignment; for; single; processor (search for similar items in EconPapers)
Date: 1982
References: Add references at CitEc
Citations: View citations in EconPapers (79)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.30.2.391 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:30:y:1982:i:2:p:391-399

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().