Journal of the Korean Operations Research and Management Science Society (한국경영과학회지)

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지

A Design Problem of a Two-Stage Cyclic Queueing Network

두 단계로 구성된 순환대기네트워크의 설계

  • Published : 2006.03.01
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper we consider a design problem of a cyclic queueing network with two stages, each with a local buffer of limited capacity. Based on the theory of reversibility and product-form solution, we derive the throughput function of the network as a key performance measure to maximize. Two cases are considered. In case each stage consists of a single server, an optimal allocation policy of a given buffer capacity and work load between stages as well as the optimal number of customers is identified by exploiting the properties of the throughput function. In case each stage consists of multiple servers, the optimal policy developed for the single server case doesn't hold any more and an algorithm is developed to allocate with a small number of computations a given number of servers, buffer capacity as well as total work load and the total number of customers. The differences of the optimal policies between two cases and the implications of the results are also discussed. The results can be applied to support the design of certain manufacturing and computer/communication systems.

Keywords

References

  1. Bozer, Y.A. and J.A. White, 'A Generalized Design and Performance Analysis Model for End-of-Aisle Order-Picking Systems,' IIE Trans. Vol.28(1996), pp.271-280 https://doi.org/10.1080/07408179608966275
  2. Fox, B., 'Discrete Optimization via Marginal Analysis,' Management Science, Vol. 13(1969), pp.210-216 https://doi.org/10.1287/mnsc.13.3.210
  3. Gaver, D.P. and G.S. Shelder, 'Processor Utilization in Multiprogramming Systems via Diffusion Approximation,' Operations Research, Vol.21(1973), pp.569-576 https://doi.org/10.1287/opre.21.2.569
  4. Gelenbe, E., 'On Approximate Computer System Models,' Associated Computing Machinery, Vol.22(1975), pp.261-269 https://doi.org/10.1145/321879.321888
  5. Glasserman, P.G. and D.D. Yao, 'Monotonicity in Generalized Semi-Markov Processes,' Mathematics of Operations Research, Vol.17(1992), pp.1-21 https://doi.org/10.1287/moor.17.1.1
  6. Glasserman, P.G. and D.D. Yao, Monotone Structure in Discrete Event Systems, Wiley, New York, 1994
  7. Glasserman, P.G. and D.D. Yao, 'Structured Buffer-Allocation Problems,' Discrete Event Dynamic Systems：Theory and Applications, Vol.6(1996), pp.9-41 https://doi.org/10.1007/BF01796782
  8. Kelly, F.P., Reversibility and Stochastic Networks, Wiley, New York, 1979
  9. Kemeny, J.G. and J.L. Snell, Finite Markov Chains, Springer-Verlag, New York, 1976
  10. Marshall, A.W. and I. Olkin, Inequalities Theory of Majorization and It's Applications, Academic Press, New York, 1979
  11. Shaked, M. and J.G. Shanthikumar, 'Stochastic Convexity and It's Applications,' Advances of Applied Probability, Vol.20 (1988), pp.427-446 https://doi.org/10.2307/1427398
  12. Sparaggis, P.D. and W. Gong, 'Optimal Buffer Allocation in a Two-Stage Queueing System,' Journal of Applied Probability, Vol.30(1993), pp.478-482 https://doi.org/10.2307/3214858
  13. Shanthikumar, J.G. and D.D. Yao, 'Optimal Server Allocation in A System of Multiserver Stations,' Management Science, Vol.33, No.9(1987), pp.1173-1180 https://doi.org/10.1287/mnsc.33.9.1173
  14. Shanthikuma, J.G. and D.D. Yao, 'Second- Order Properties of the Throughput of a Closed Queueing Network,' Mathematics of Operations Research, Vol.13(1988), pp.524-534 https://doi.org/10.1287/moor.13.3.524
  15. Shanthikumar, J.G. and D.D. Yao, 'Monotonicity and Concavity Properties in Cyclic Queueing Networks with Finite Buffers,' in H.G. Perros, and T. Altiok eds.：Queueing Networks with Blocking, North-Holland, pp.325-344, 1989
  16. Stecke, K.E. and J.J. Solberg, 'The Optimality of Unbalancing Both Workloads and Machine Group Sizes in Closed Queueing Networks of Multi-server Queues,' Operations Research, Vol.33(1985), pp.882- 920 https://doi.org/10.1287/opre.33.4.882
  17. Yao, D.D., 'Some Properties of the Throughput Function of Closed Networks of Queues,'Operations Research Letters, Vol.3, No.6 (1985), pp.313-317 https://doi.org/10.1016/0167-6377(85)90007-0
  18. Yao, D.D. and J.A. Buzacott, 'Modeling a Class of Flexible Manufacturing Systems with Reversible Routing,' Operations Research, Vol.35(1987), pp.87-93 https://doi.org/10.1287/opre.35.1.87