Priority Update Intervals and Anomalies in Dynamic Ratio Type Job Shop Scheduling Rules

Nabil R. Adam and Julius Surkis
Additional contact information
Nabil R. Adam: Rutgers University
Julius Surkis: Rutgers University

Management Science, 1980, vol. 26, issue 12, 1227-1237

Abstract: Dynamic priority dispatching rules in job shops require the computation of all job priorities in a work center queue every time a machine in the work center becomes idle. This is extremely costly. Alternative priority update procedures are studied and comparative results in terms of performance measures and costs are reported. Ease of implementation of the various procedures in a real world job shop environment is discussed. A second problem related to an anomaly in ratio type dynamic priority rules is also studied; a simple modification to remove the anomaly is suggested and the performances of the "old" and "modified" procedures are compared.

Keywords: simulation: applications; production/scheduling: job shop; deterministic; queues: priority (search for similar items in EconPapers)
Date: 1980
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.26.12.1227 (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:26:y:1980:i:12:p:1227-1237

Access Statistics for this article

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