Skip to main content
SpringerLink
Log in

Bounds and heuristics for assembly-like queues

  • Contributed Papers
  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

We consider an assembly system with exponential service times, and derive bounds for its average throughput and inventories. We also present an easily computed approximation for the throughput, and compare it to an existing approximation.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. T. Altiok, Approximate analysis of exponential tandem queues with blocking, European Journal of Operations Research 11 (1982) 390.

    Google Scholar 

  2. M.H. Ammar, Modelling and analysis of unreliable manufacturing assembly networks with finite storage, MIT Laboratory for Information and Decision Sciences, Report LIDS-TH-1004, June 1980.

  3. U.N. Bhat, Finite capacity assembly-like queues, Queueing Systems: Theory and Applications 1 (1986) 85.

    Google Scholar 

  4. F. Bonomi, An approximate analysis for a class of assembly-like queues, Queueing Systems: Theory and Applications 1 (1987) 289.

    Google Scholar 

  5. J.A. Buzacott, Automatic transfer lines with buffer stocks, International Journal of Production Research 5 (1967) 183.

    Google Scholar 

  6. J.B. Dennis, Data flow super computers, IEEE Computer 13, 11 (1980) 48.

    Google Scholar 

  7. S.B. Gershwin and I.C. Schick, Modelling and analysis of three-stage transfer lines with unreliable machines and finite buffers, Operations Research 31 (1983) 354.

    Google Scholar 

  8. D. Gross and C.M. Harris,Fundamentals of Queueing Theory (John Wiley & Sons, New York, 1985).

    Google Scholar 

  9. J.M. Harrison, Assembly-like Queues, Journal of Applied Probability 10 (1973) 354.

    Google Scholar 

  10. J.M. Hatcher, The effect of internal storage on the production rate of a series having exponential service times, AIIE Transactions 1 (1969) 150.

    Google Scholar 

  11. F.S. Hillier and R.N. Boling, Finite queues in series with exponential or Erlang service times — A numerical approach, Operations Research 15 (1967) 286.

    Google Scholar 

  12. G.C. Hunt, Sequential arrays of waiting lines, Operations Research 4 (1956) 674.

    Google Scholar 

  13. G. Latouche, Queues with paired customers, Journal of Applied Probability 18 (1981) 684.

    Google Scholar 

  14. E.H. Lipper and B. Sengupta, Assembly-like queues with finite capacity: bounds, asymptotics and approximations, Queueing Systems: Theory and Applications 1 (1986) 67.

    Google Scholar 

  15. Y. Monden, Adaptable Kanban system helps Toyota maintain just-in-time production, Industrial Engineering 13 (1981) 29.

    Google Scholar 

  16. M.F. Neuts,Matrix-Geometric Solutions in Stochastic Models (The Johns Hopkins University Press, Baltimore, 1981).

    Google Scholar 

  17. S.M. Ross,Stochastic Processes (John Wiley & Sons, New York, 1983).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering and Management Sciences, Northwestern University, 60208, Evanston, IL, USA

    Wallace J. Hopp & John T. Simon

Authors
  1. Wallace J. Hopp
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. John T. Simon
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hopp, W.J., Simon, J.T. Bounds and heuristics for assembly-like queues. Queueing Syst 4, 137–155 (1989). https://doi.org/10.1007/BF01158549

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01158549

Keywords

Search

Navigation