Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties

Jeffrey B. Sidney
Additional contact information
Jeffrey B. Sidney: University of Ottawa, Ottawa, Ontario

Operations Research, 1977, vol. 25, issue 1, 62-69

Abstract: We consider a single-machine job shop scheduling problem in which penalties occur for jobs that either commence before their target start times or are completed after their due dates. The objective is to minimize the maximum penalty, subject to restrictive assumptions on the target start times, the due dates, and the penalty functions. We present an algorithm for solving this problem, along with a method for generating alternative optima. The algorithm is generalized to cover the case in which the machine is available for only a limited time span.

Date: 1977
References: Add references at CitEc
Citations: View citations in EconPapers (28)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.25.1.62 (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:25:y:1977:i:1:p:62-69

Access Statistics for this article

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