Optimal server allocation in closed finite queueing networks
- 239 Downloads
Many topological network design problems in manufacturing and service systems can be modelled with closed queueing networks, finite buffers, and multiple-servers. Because of their integrality, it is difficult to predict the performance of these problems, let alone optimize their parameters. This paper presents a new queue decomposition approach for the modelling of these finite buffer closed queueing networks with multiple servers along with an integrated approach to the optimization of the allocation of the servers in the network topology. The performance and optimization algorithms are described and a number of experiments for series, merge, and split topologies together with the integration of material handling and layout systems are carried out.
KeywordsClosed Finite networks \(M/M/c/K\) and \(M/G/c/c\) queues
We are indebted to Klaus Schittkowsi and his colleagues for letting us use their sequential quadratic nonlinear programming routine along with the branch-and-bound code and embedding it in our queue decomposition methodology. Overall, it performed very well. We are also indebted to the referees for their cogent and insightful comments on the drafts of the paper.
- Buzzacott J, Shantikumar JG (1993) Stochastic models of manufacturing systems. Prentice-Hall, Englewood CliffsGoogle Scholar
- Exler O, Lehmann T, Schittkowski K (2012) MISQP: A Fortran subroutine of a trust region SQP algorithm for mixed-integer nonlinear programming-users guide. Department of Computer Science, University of Bayreuth, GermanyGoogle Scholar
- Kelton D, Sadowski R, Swets N (2010) Simulation with Arena, 5th edn. McGraw-Hill, New YorkGoogle Scholar
- Kobayashi H, Mark BL (1994) On queueing networks and loss networks. In: Proceedings of the 28th annual conference on information sciences and systems. Princeton, New Jersey, pp 794–799Google Scholar
- Smith JM (2014) Queue decomposition and finite closed queueing network models. Working paper. Department of Mechanical and Industrial Engineering, University of Massachusetts, Amherst, MAGoogle Scholar
- Suri R, Sahu S, Vernon M (2007) Approximate mean value analysis for closed queueing networks with multiple-server stations. In: Bayraksan G, Lin W, Wysk R (eds) Proceedings of the 2007 IERCGoogle Scholar
- Yarmand MH (2013) Optimal allocation in zero-buffer tandem queues. Open access dissertations and theses. Paper no. 7690Google Scholar
- Yuzukirmizi M (2005) Closed finite queueing networks with multiple servers and multiple customer types. Ph.D. Dissertation. Department of Industrial Engineering and Operations Research at the University of Massachusetts, Amherst Campus, March 2005Google Scholar