Abstract
We study a queueing network where customers go through several stages of processing, with the class of a customer used to indicate the stage of processing. The customers are serviced by a set of flexible servers, i.e., a server may be capable of serving more than one class of customer and the sets of classes that the servers are capable of serving may overlap. We would like to choose an assignment of servers that achieves the maximal capacity of the given queueing network, where the maximal capacity is λ* if the network can be stabilized for all arrival rates λ < λ* and cannot possibly be stabilized for all λ > λ*. We examine the situation where there is a restriction on the number of servers that are able to serve a class, and reduce the maximal capacity objective to a maximum throughput allocation problem of independent interest: the Total Discrete Capacity Constrained Problem (TDCCP). We prove that solving TDCCP is in general NP-complete, but we also give exact or approximation algorithms for several important special cases.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andradóttir, S., Ayhan, H.: Throughput maximization for tandem lines with two stations and flexible servers. Operations Research 53, 516–531 (2005)
Andradóttir, S., Ayhan, H., Down, D.G.: Server assignment policies for maximizing the steady-state throughput of finite queueing systems. Management Science 47, 1421–1439 (2001)
Andradóttir, S., Ayhan, H., Down, D.G.: Dynamic server allocation for queueing networks with flexible servers. Operations Research 51, 952–968 (2003)
Armony, M., Bambos, N.: Queueing networks with interacting service resources. In: Proceedings of the 37th Annual Allerton Conference on Communications, Control, and Computing, pp. 42–51 (1999)
Baier, G., Köhler, E., Skutella, M.: On the k-splittable flow problem. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, p. 101. Springer, Heidelberg (2002)
Bischak, D.P.: Performance of a manufacturing module with moving workers. IIE Transactions 28, 723–733 (1996)
Dai, J.G.: On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models. Annals of Applied Probability 5, 49–77 (1995)
Dai, J.G., Lin, W.: Maximum pressure policies in stochastic processing networks. Operations Research 53, 197–218 (2005)
Dinitz, Y., Garg, N., Goemans, M.: On the single-source unsplittable flow problem. Combinatorica 19, 17–41 (1999)
Garey, M.R., Johnson, D.S.: Computers and Intractability: a guide to the theory of NP-Completeness. W.H. Freeman and Co., New York (1979)
Grötschel, M., Lovász, L., Schrijver, A.: Geometric algorithms and combinatorial optimization, ch. 6. Springer, Heidelberg (1993)
Hillier, F.S., So, K.C.: On the simultaneous optimization of server and work allocations in production line systems with variable processing times. Operations Research 44, 435–443 (1996)
Hopp, W.J., van Oyen, M.P.: Agile workforce evaluation: A framework for cross-training and coordination. IIE Transactions 36, 919–940 (2004)
Kolliopoulos, S.G., Stein, C.: Approximation algorithms for single-source unsplittable flow. SIAM J. Computing 31, 919–946 (2002)
Rybko, A.N., Stolyar, A.L.: Ergodicity of stochastic processes describing the operation of open queueing networks. Problems of Information Transmission 28, 199–220 (1992)
Shmoys, D.B., Tardos: An approximation algorithm for the generalized assignment problem. Mathematical Programming A 62(3), 461–474 (1993)
Squillante, M.S., Xia, C.H., Yao, D.D., Zhang, L.: Threshold-based priority policies for parallel-server systems with affinity scheduling. In: Proceedings of the 2001 American Control Conference, pp. 2992–2999 (2001)
Tassiulas, L., Bhattacharya, P.B.: Allocation of independent resources for maximal throughput. Stochastic Models 16, 27–48 (2000)
Tassiulas, L., Ephrimedes, A.: Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Transactions on Automatic Control 37, 1936–1948 (1992)
Zavadlav, E., McClain, J.O., Thomas, L.J.: Self-buffering, self-balancing, selfflushing production lines. Management Science 42, 1151–1164 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Down, D.G., Karakostas, G. (2006). Maximizing Throughput in Queueing Networks with Limited Flexibility. In: Correa, J.R., Hevia, A., Kiwi, M. (eds) LATIN 2006: Theoretical Informatics. LATIN 2006. Lecture Notes in Computer Science, vol 3887. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11682462_38
Download citation
DOI: https://doi.org/10.1007/11682462_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32755-4
Online ISBN: 978-3-540-32756-1
eBook Packages: Computer ScienceComputer Science (R0)