General Open and Closed Queueing Networks with Blocking: A Unified Framework for Approximation

References

  • Akyildiz I.F. Exact product form solutions for queueing networks with blocking. IEEE Trans. Comput. (1987) 1:121–126Google Scholar
  • Baskett F., Chandy K.M., Muntz R.R., Palacios F.G. Open, closed, and mixed networks of queues with different classes of customers. J. ACM (1975) 22:249–260CrossrefGoogle Scholar
  • Baynat B., Dallery Y. A unified view of product-form approximation techniques for general closed queueing networks. Perform. Eval. (1993) 18:205–224CrossrefGoogle Scholar
  • Bruell S.C., Balbo G.Computational Algorithms for Closed Queueing Networks (1980) (Elsevier North-Holland, Amsterdam) Google Scholar
  • Buzacott J.A. Kanban and MRP Controlled Production System. (1988) (University of Waterloo, Ontario, Canada) . Working Paper, Department of Management ScienceGoogle Scholar
  • Buzen J.P. Computational algorithms for closed queueing networks with exponential servers. Communications of the ACM (1973) 16:527–531CrossrefGoogle Scholar
  • Cheng D.W., Yao D.D. Tandem queues with general blocking: a unified model and comparison results. Discrete Event Dynamic Systems (1994) 2:207–234CrossrefGoogle Scholar
  • Dallery Y. Approximate analysis of general open queueing networks with restricted capacity. Perform. Eval. (1990) 11:209–222CrossrefGoogle Scholar
  • Dallery Y., Frein Y. On decomposition methods for tandem queueing networks with blocking. Opns. Res. (1993) 41:386–399LinkGoogle Scholar
  • Di Mascolo M., Frein Y., Dallery Y. An analytic method for performance evaluation of kanban controlled production systems. Opns. Res. (1996) 44:50–64LinkGoogle Scholar
  • Gordon W.J., Newell G.F. Cyclic queueing systems with restricted queues. Oper. Res. (1967a) 15:266–278LinkGoogle Scholar
  • Gordon W.J., Newell G.F. Closed queueing systems with exponential servers. Oper. Res. (1967b) 15:254–265LinkGoogle Scholar
  • Govil M.K., Fu M.C. Queueing theory in manufacturing: a survey. J. of Manf. Sys. (1999) 18:214–240CrossrefGoogle Scholar
  • Marie R. Calculating equilibrium probabilities for λ(n)/Ckk/1/N queues. Perform. Eval. Rev. (1980) 9:117–125CrossrefGoogle Scholar
  • Mitra D., Mitrani I. Analysis of a kanban discipline for cell coordination in production lines. I. Mgmt. Sci. (1990) 35:1548–1566LinkGoogle Scholar
  • Mitra D., Mitrani I. Analysis of a kanban discipline for cell coordination in production lines, II: stochastic demands. Opns. Res. (1991) 36:807–823LinkGoogle Scholar
  • Onvural R.O. Survey of closed queueing networks with blocking. ACM Computing Surveys (1990) 22:83–121CrossrefGoogle Scholar
  • Pegden C.D., Shannon R.E., Sadowski R.P.Introduction to Simulation Using SIMAN (1995) 2nd ed.(McGraw-Hill, New York) Google Scholar
  • Perros H.G.Queueing Networks with Blocking: Exact and Approximate Solutions (1994) (Oxford University Press, New York) Google Scholar
  • Perros H.G., Nilsson A., Liu Y.G. Approximate analysis of product form type queueing networks with blocking and deadlock. Perform. Eval. (1988) 8:19–39CrossrefGoogle Scholar
  • Ramesh R., Prasad S.Y., Thirumurthy M. Flow control in kanban multicell manufacturing, I. A structured analysis of general blocking design space. Int. Journal of Prod. Research (1997a) 35:2327–2342CrossrefGoogle Scholar
  • Ramesh R., Prasad S.Y., Thirumurthy M. Flow control in kanban multicell manufacturing, II. Design of control systems and experimental results. Int. Journal of Prod. Research (1997b) 35:2413–2427CrossrefGoogle Scholar
  • Stallings W.Data and Computer Communications (1997) 5th ed.(Prentice-Hall, New Jersey) Google Scholar
  • Van Dijk N.M., Tijms H.C., Boxma, Cohen, Tijms. Insensitivity to Two Node Blocking Models With Applications, Teletraffic Analysis and Computer Performance Evaluation (1986) (Elsevier North-Holland, Amsterdam) 329–340Google Scholar
  • Zipkin P. A kanban-like production control system: analysis of simple models. (1989) (Graduate School of Business, Columbia University, New York) . Research Working Paper No. 89-1Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.