A Single Machine Model for Determination of Optimal Due Dates and Sequence

Suresh Chand and Dilip Chhajed
Additional contact information
Suresh Chand: Purdue University, West Lafayette, Indiana
Dilip Chhajed: University of Illinois, Champaign, Illinois

Operations Research, 1992, vol. 40, issue 3, 596-602

Abstract: The problem of simultaneous determination of optimal due dates and optimal sequence for N -job single machine problem with multiple due dates is considered in this paper. The penalty for a job is assumed to be a linear function of the due date and the earliness/tardiness for the job. The objective is to minimize the total penalty for all jobs. An efficient optimal algorithm to solve the problem is developed and several results are provided.

Keywords: production/scheduling: single machine scheduling; deterministic (search for similar items in EconPapers)
Date: 1992
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.40.3.596 (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:40:y:1992:i:3:p:596-602

Access Statistics for this article

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