Due-Dates and Instantaneous Load in the One-Machine Shop

E. L. Heard
Additional contact information
E. L. Heard: University of South Carolina

Management Science, 1976, vol. 23, issue 4, 444-450

Abstract: The due-date assignment problem occurs when due-dates are assigned within, rather than outside, a job shop. This study explores the importance of instantaneous and future shop loads in setting due-dates in shops operating under due-date dependent queue discipline. The assignment of due-dates to arriving jobs in an m-machine shop is formulated as a stochastic dynamic programming problem in the first part of this study. A computational experiment using dynamic programming is performed in the second part and due-dates are developed for specific instantaneous load conditions in a simulated one-machine shop. The importance of instantaneous and future shop loads for assigning due-dates in a one-machine shop, with constant interarrivals and exponential service times, is shown.

Date: 1976
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.23.4.444 (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:23:y:1976:i:4:p:444-450

Access Statistics for this article

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