×

Bounds and heuristics for assembly-like queues. (English) Zbl 0673.90036

Summary: 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.

MSC:

90B22 Queues and service in operations research
90B30 Production models
60K25 Queueing theory (aspects of probability theory)
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] T. Altiok, Approximate analysis of exponential tandem queues with blocking, European Journal of Operations Research 11 (1982) 390. · Zbl 0497.60096 · doi:10.1016/0377-2217(82)90204-1
[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. · Zbl 0651.90030 · doi:10.1007/BF01149329
[4] F. Bonomi, An approximate analysis for a class of assembly-like queues, Queueing Systems: Theory and Applications 1 (1987) 289. · Zbl 0651.90029 · doi:10.1007/BF01149540
[5] J.A. Buzacott, Automatic transfer lines with buffer stocks, International Journal of Production Research 5 (1967) 183. · doi:10.1080/00207546708929751
[6] J.B. Dennis, Data flow super computers, IEEE Computer 13, 11 (1980) 48.
[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. · Zbl 0507.90042 · doi:10.1287/opre.31.2.354
[8] D. Gross and C.M. Harris,Fundamentals of Queueing Theory (John Wiley & Sons, New York, 1985). · Zbl 0658.60122
[9] J.M. Harrison, Assembly-like Queues, Journal of Applied Probability 10 (1973) 354. · Zbl 0272.60061 · doi:10.2307/3212352
[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.
[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. · Zbl 0171.16302 · doi:10.1287/opre.15.2.286
[12] G.C. Hunt, Sequential arrays of waiting lines, Operations Research 4 (1956) 674. · Zbl 0073.01602 · doi:10.1287/opre.4.6.674
[13] G. Latouche, Queues with paired customers, Journal of Applied Probability 18 (1981) 684. · Zbl 0463.60084 · doi:10.2307/3213322
[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. · Zbl 0649.90060 · doi:10.1007/BF01149328
[15] Y. Monden, Adaptable Kanban system helps Toyota maintain just-in-time production, Industrial Engineering 13 (1981) 29.
[16] M.F. Neuts,Matrix-Geometric Solutions in Stochastic Models (The Johns Hopkins University Press, Baltimore, 1981). · Zbl 0469.60002
[17] S.M. Ross,Stochastic Processes (John Wiley & Sons, New York, 1983).
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.