×

zbMATH — the first resource for mathematics

Optimal server allocation in general, finite, multi-server queueing networks. (English) Zbl 1226.90028
Summary: Queueing networks with finite buffers, multiple servers, arbitrary acyclic, series-parallel topologies, and general service time distributions are considered in this paper. An approach to optimally allocate servers to series, merge, and split topologies and their combinations is demonstrated. The methodology builds on two-moment approximations to the service time distribution embedded in the generalized expansion method for computing the performance measures in complex finite queueing networks and Powell’s algorithm for optimally allocating servers to the network topology. Convexity of the objective function along with results from computational experiments is presented for showing the efficacy of the methodology.

MSC:
90B22 Queues and service in operations research
90B15 Stochastic network models in operations research
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Smith, The buffer allocation problem for general finite buffer queueing networks, IIE Transactions on Design and Manufacturing 37 (4) pp 343– (2005)
[2] Smith, Topological network design of general finite multi-server queueing networks, European Journal of Operational Research (2009)
[3] Whitt, Understanding the efficiency of multi-server service systems, Management Science 38 (5) pp 708– (1992) · Zbl 0825.90409
[4] Borst, Dimensioning large call centers, Operations Research 52 (17-34) pp 1– (2004) · Zbl 1165.90388
[5] Kerbache, The generalized expansion method for open finite queueing networks, European Journal of Operational Research 32 pp 448– (1987) · Zbl 0691.60088
[6] Smith, Optimal design and performance modelling of M/G/1/K queueing systems, Mathematical and Computer Modelling 39 (9-10) pp 1049– (2004)
[7] Himmelblau, Applied Nonlinear Programming (1972)
[8] Brigham, On a congestion problem in an aircraft factory, Journal of the Operations Research Society of America 3 (4) pp 412– (1955)
[9] Morse, Queues, Inventories and Maintenance: The Analysis of Operational Systems with Variable Demand and Supply (1958)
[10] Manglesdorf, Analysis of Industrial Operations (1959)
[11] Hillier, Economic models for industrial waiting line problems, Management Science 10 (1) pp 119– (1963)
[12] Rolfe, A note on marginal allocation in multiple-server service systems, Management Science 17 (9) pp 656– (1971) · Zbl 0217.50602
[13] Newell, Applications of Queueing Theory (1982)
[14] Dyer, On the validity of marginal analysis for allocating servers in M/M/c queues, Management Science 23 (9) pp 1019– (1977) · Zbl 0368.60108
[15] Weber, On the marginal benefit of adding servers to G/GI/m queues, Management Science 26 (9) pp 946– (1980) · Zbl 0445.60076
[16] Bitran, Tradeoff curves, targeting and balancing in manufacturing queueing networks, Operations Research 37 (4) pp 547– (1989) · Zbl 0674.90043
[17] Dallery, On the optimal allocation of servers and workloads in closed queueing networks, Operations Research 38 (4) pp 694– (1990) · Zbl 0718.90033
[18] Shanthikumar, On server allocation in multiple center manufacturing systems, Operations Research 36 (2) pp 333– (1998)
[19] Wein, Capacity allocation in generalized Jackson networks, Operations Research Letters 8 (3) pp 143– (1989) · Zbl 0676.90024
[20] Kulkarni, Modeling, Analysis, Design, and Control of Stochastic Systems (1982)
[21] Hillier, Introduction to Operations Research (2005)
[22] White, Analysis of Queueing Systems (1975)
[23] Gross, Fundamentals of Queueing Theory (1985)
[24] Shanthikumar, Optimal server allocation in a system of multi-server stations, Management Science 33 (9) pp 1173– (1987) · Zbl 0636.90034
[25] Hillier, The assignment of extra servers to stations in tandem queueing systems with small or no buffers, Performance Evaluation 10 pp 219– (1989)
[26] Hillier, On the simultaneous optimization of server and work allocations in production line systems with variable processing times, Operations Research 44 (3) pp 435– (1996) · Zbl 0864.90056
[27] Magazine, Throughput for production lines with serial workstations and parallel service facilities, Performance Evaluation 25 pp 211– (1996) · Zbl 0875.68994
[28] Spinellis, Large production line optimization using simulated annealing, International Journal of Production Research 38 (3) pp 509– (2000) · Zbl 0944.90518
[29] Futamura, The multiple server effect: optimal allocation of servers to stations with different service-time distributions in tandem queueing networks, Annals of Operations Research 93 (1-4) pp 71– (2000) · Zbl 0953.90006
[30] Smith, M/G/c/K blocking probability models and system performance, Performance Evaluation 52 (4) pp 237– (2003)
[31] De Kok, A two-moment approximation for a buffer design problem requiring a small rejection probability, Performance Evaluation 5 pp 77– (1985)
[32] Tijms, Stochastic Modeling and Analysis (1986)
[33] Tijms, Stochastic Models: An Algorithmic Approach (1994)
[34] Köchel, Finite queueing systems-structural investigations and optimal design, International Journal of Production Economics 88 pp 157– (2004)
[35] Gosavi, Asymptotic bounds of throughput in series-parallel queueing networks, Computers and Operations Research 22 (10) pp 1057– (1995) · Zbl 0838.90043
[36] Glasserman, Monotonicity in generalized semi-Markov processes, Mathematics of Operations Research 17 (1) pp 1– (1992) · Zbl 0753.60082
[37] Rajan, Concavity of queueing systems with NBU service times, Advances in Applied Probability 30 (2) pp 551– (1998) · Zbl 0915.60086
[38] Labetoulle, Isolation method in a network of queues, IEEE Transactions on Software Engineering, Volume SE-6 4 pp 373– (1980)
[39] Kleinrock, Queueing Systems, Volume I: Theory (1975)
[40] Kerbache, Asymptotic behaviour of the expansion method for open finite queueing networks, Computers and Operations Research 15 (2) pp 157– (1988) · Zbl 0662.60105
[41] Lemaréchal, The omnipresence of Lagrange, Annals of Operations Research 153 (1) pp 9– (2007) · Zbl 1157.90509
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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.