Abstract
This paper calls attention to two of the more successful queuing approximation formulae — one by Kramer and one by Marchal. The analytic solution of a range of single server Erlang cases is compared to the two approximation formulae. Then a family of H2/M/1 cases is similarly considered. Maximum errors are seen to be about three percent. The Kramer formula seems to be better when the interarrival coefficient of variation is less than 0.66 and the Marchal formula is better for larger interarrival coefficients of variation. Finally, a multiserver refinement function (the ratio of G/G/1 results to M/M/1 results) is proposed to scale M/M/s as an approximation for G/G/s. In most of these multiple channel cases, the maximum error is less than six percent. The last section of this paper presents a simple, representative FMS. It is modelled as an open queuing network. Then the approximation procedure is applied node by node to illustrate the estimation of system performance measures such as machine utilizations and throughput.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
O. Boxma, Cohen and Huffels, Approximations of the mean waiting time in an M/G/s queueing system, Oper. Res. 27, 6(1979)1115.
J.A. Buzacott and J.G. Shanthikumar, Models for understanding flexible manufacturing systems, AIIE Trans. 12(1980)339.
J. Fraker, Approximate techniques for the analysis of tandem queueing systems, Ph.D. Diss., Dept. of Industrial Engineering, Clemson University (1971).
E. Gelenbe, On approximate computer system models, in:Computer Architectures and Networks, ed. E. Gelenbe and R. Mohl (North-Holland, Amsterdam, 1974) p. 187.
D. Heyman, A diffusion model approximation for the GI/G/1 queues in heavy traffic, Bell System Technical Journal 54(1975)1637.
F. Hillier and P. Yu,Queueing Tables and Graphs (North-Holland, Amsterdam, 1981).
H. Kobayashi, Applications of the diffusion approximation to queueing networks, I. Equilibrium queue distributions, Journal of the Association for Computing Machinery 21, 2(1974) 316.
W. Kramer and Lagenbach-Belz, Approximate formulae for the delay in the queueing system GI/G/1,Congressbook, 8th Int. Teletraffic Congress, Melbourne, 1976, pp. 235.1–235.8.
A.M. Lee and P.A. Longton, Queueing processes association with airline passenger check-in, Opnl. Res. Quart. 10(1959)56.
W. Marchal, An approximate formula for waiting time in single server queues, AIIE Trans. 8(1976)473.
E. Page, Queueing theory in OR,Operational Research Series, ed. K. Haley, 1972.
M. Reiser and H. Kobayashi, Accuracy of the diffusion approximation for some queueing systems, IBM Journal of Research and Development 18(1974)110.
H. Sakasegawa, An approximation formulaLq ≅ αρβ/1 −ρ, Ann. Inst. Statist. Math., Tokyo, 29A(1977)67.
J. Shanthikumar and J. Buzacott, On the approximations to the single server queue, Int. J. Prod. Res. 18, 6(1980)761.
D. Shimshak, A comparison of waiting time approximations in series queueing systems, Naval Research Logistics Quart. 26(1979)499.
R. Suri and R.R. Hildebrant, Modelling flexible manufacturing systems using mean value analysis, Journal of Manufacturing Systems 3, 1(1984)27.
W. Whitt, The queueing network analyzer, Bell System Technical Journal 62, 9(1983)2779.
P. Yu, On accuracy improvement and applicability conditions of diffusion approximation with applications to modelling of computer systems, TR-129, Digital Systems Laboratory, Stanford University (1977).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Marchal, W.G. Numerical performance of approximate queuing formulae with application to flexible manufacturing systems. Ann Oper Res 3, 141–152 (1985). https://doi.org/10.1007/BF02024743
Issue Date:
DOI: https://doi.org/10.1007/BF02024743