Sequencing Rules and Due-Date Assignments in a Job Shop
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.
Volume (Year): 30 (1984)
Issue (Month): 9 (September)
|Contact details of provider:|| Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA|
Web page: http://www.informs.org/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:30:y:1984:i:9:p:1093-1104. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc)
If references are entirely missing, you can add them using this form.