On Approximate Queueing Models of Dynamic Job Shops

J. A. Buzacott and Jevaveerasingam Shanthikumar
Additional contact information
J. A. Buzacott: Department of Management Sciences, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1

Management Science, 1985, vol. 31, issue 7, 870-887

Abstract: In this paper we consider a class of job shops with a dispatch area and a machine shop, where operational controls are exercised at the dispatch area as well as at the machine shop. For such dynamic job shops with these two levels of control, there are three categories of models. They are (1) pseudo-static, (2) pure dynamic, and (3) pseudo-dynamic. In this paper approximate queueing models are developed for pure dynamic and pseudo-dynamic job shops; open queueing network models and controlled arrival single stage queueing models, respectively. The accuracy of the open queueing network models and their use are illustrated. An example indicative of the possible accuracy of the controlled arrival single stage queueing models is also given.

Keywords: queues: approximations; production/scheduling: job shop; stochastic; networks/graphs: stochastic (search for similar items in EconPapers)
Date: 1985
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.31.7.870 (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:31:y:1985:i:7:p:870-887

Access Statistics for this article

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