IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v31y1985i7p870-887.html
   My bibliography  Save this article

On Approximate Queueing Models of Dynamic Job Shops

Author

Listed:
  • J. A. Buzacott

    (Department of Management Sciences, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1)

  • J. G. Shanthikumar

    (School of Business Administration, University of California, Berkeley, California 94720)

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.

Suggested Citation

  • J. A. Buzacott & J. G. Shanthikumar, 1985. "On Approximate Queueing Models of Dynamic Job Shops," Management Science, INFORMS, vol. 31(7), pages 870-887, July.
    • Handle: RePEc:inm:ormnsc:v:31:y:1985:i:7:p:870-887
    DOI: 10.1287/mnsc.31.7.870
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.31.7.870
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.31.7.870?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Subba Rao, S. & Gunasekaran, A. & Goyal, S. K. & Martikainen, T., 1998. "Waiting line model applications in manufacturing," International Journal of Production Economics, Elsevier, vol. 54(1), pages 1-28, January.
    2. Marc R. Lambrecht & Philip L. Ivens & Nico J. Vandaele, 1998. "ACLIPS: A Capacity and Lead Time Integrated Procedure for Scheduling," Management Science, INFORMS, vol. 44(11-Part-1), pages 1548-1561, November.
    3. William A. Massey & Raj Srinivasan, 2002. "Steady State Analysis and Heavy Traffic Limits for Regulated Markov Chains," RePAd Working Paper Series lrsp-TRS374, Département des sciences administratives, UQO.
    4. Bretthauer, Kurt M., 1996. "Capacity planning in manufacturing and computer networks," European Journal of Operational Research, Elsevier, vol. 91(2), pages 386-394, June.
    5. Kris Lieckens & Nico Vandaele, 2016. "Differential evolution to solve the lot size problem in stochastic supply chain management systems," Annals of Operations Research, Springer, vol. 242(2), pages 239-263, July.
    6. Yonit Barron & Opher Baron, 2020. "The residual time approach for (Q, r) model under perishability, general lead times, and lost sales," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 92(3), pages 601-648, December.
    7. Van Nyen, Pieter L. M. & Van Ooijen, Henny P. G. & Bertrand, J.W.M.J. Will M., 2004. "Simulation results on the performance of Albin and Whitt's estimation method for waiting times in integrated production-inventory systems," International Journal of Production Economics, Elsevier, vol. 90(2), pages 237-249, July.
    8. Sabuncuoglu, I. & Comlekci, A., 2002. "Operation-based flowtime estimation in a dynamic job shop," Omega, Elsevier, vol. 30(6), pages 423-442, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:31:y:1985:i:7:p:870-887. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.