Sequencing Rules and Due-Date Assignments in a Job Shop

Kenneth R. Baker
Additional contact information
Kenneth R. Baker: Amos Tuck School of Business Administration, Dartmouth College, Hanover, New Hampshire 03753

Management Science, 1984, vol. 30, issue 9, 1093-1104

Abstract: Recent research studies of job shop scheduling have begun to examine the interaction between sequencing priorities and the method of assigning due-dates. This paper surveys the tactical aspects of this interaction, focusing primarily on average tardiness as a measure of scheduling effectiveness. The discussion highlights several factors that can affect the performance of dispatching rules, such as the average flow allowance, the due-date assignment method, and the use of progress milestones. A set of simulation experiments illuminates how these factors interact with the dispatching rule, and the experimental results suggest which combinations are most effective in a scheduling system.

Keywords: production/scheduling: job shop; stochastic; inventory/production: policies; leadtime; simulation: application (search for similar items in EconPapers)
Date: 1984
References: Add references at CitEc
Citations: View citations in EconPapers (50)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.30.9.1093 (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:30:y:1984:i:9:p:1093-1104

Access Statistics for this article

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