Alternative Formulation of the Job Shop Problem with Due Dates

Charles A. Holloway and Rosser T. Nelson
Additional contact information
Charles A. Holloway: Stanford University
Rosser T. Nelson: University of California, Los Angeles

Management Science, 1973, vol. 20, issue 1, 65-75

Abstract: The classical formulation of the static job shop scheduling problem with job due dates implies that the question of interest to the manager is: What is the best that can be done to meet due dates with fixed resources? Here, two alternative formulations of the problem are proposed; one because of its practical appeal, the other because of its methodological appeal. The latter is used to develop a multi-pass heuristic scheduling procedure aimed at providing a practical tool for attacking any of the three formulations of the problem. This paper describes the basic structure of the scheduling procedure, the machine coding of a specific version of the procedure, and computational experience with a set of test problems ranging in size up to fourteen jobs and seven machines.

Date: 1973
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.20.1.65 (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:ormnsc:v:20:y:1973:i:1:p:65-75

Access Statistics for this article

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