Maximizing throughput in queueing networks with limited flexibility

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3887 LNCS, Issue , 2006, Pages 398-409

  Down, Douglas G ^a   Karakostas, George ^a  

^a MCMASTER UNIVERSITY   (Canada)

Author keywords

Approximation algorithms; Queueing networks; Scheduling

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING; SERVERS; THROUGHPUT;

APPROXIMATION ALGORITHMS; FLEXIBILITY; THROUGHPUT ALLOCATION PROBLEM; TOTAL DISCRETE CAPACITY CONSTRAINED PROBLEM (TDCCP);

QUEUEING NETWORKS;

EID: 33745617105     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11682462_38     Document Type: Conference Paper

References (20)

1. S. Andradóttir and H. Ayhan. Throughput maximization for tandem lines with two stations and flexible servers. Operations Research, 53:516-531, 2005.
2. S. Andradóttir, H. Ayhan, and D.G. Down. Server assignment policies for maximizing the steady-state throughput of finite queueing systems. Management Science, 47:1421-1439, 2001.
3. S. Andradóttir, H. Ayhan and D.G. Down. Dynamic server allocation for queueing networks with flexible servers. Operations Research, 51:952-968, 2003.
4. M. Armony and N. Bambos. Queueing networks with interacting service resources. Proceedings of the 37th Annual Allerton Conference on Communications, Control, and Computing, 42-51, 1999.
5. G. Baier, E. Köhler, and M. Skutella. On the k-splittable flow problem. Proceedings of ESA'02.
6. D.P. Bischak. Performance of a manufacturing module with moving workers. IIE Transactions, 28:723-733, 1996.
7. J.G. Dai. On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models. Annals of Applied Probability, 5:49-77, 1995.
8. J.G. Dai and W. Lin. Maximum pressure policies in stochastic processing networks. Operations Research, 53:197-218, 2005.
9. Y. Dinitz, N. Garg, and M. Goemans. On the single-source unsplittable flow problem. Combinatorica, 19 (1999), pp. 17-41.
10. M. R. Garey and D. S. Johnson. Computers and Intractability: a guide to the theory of NP-Completeness. W. H. Freeman and Co., 1979.
11. M. Grötschel, L. Lovász, and A. Schrijver. Geometric algorithms and combinatorial optimization, Chapter 6. Springer-Verlag, 1993.
12. P.S. Hillier and K.C. So. On the simultaneous optimization of server and work allocations in production line systems with variable processing times. Operations Research, 44:435-443, 1996.
13. W.J. Hopp and M.P. van Oyen. Agile workforce evaluation: A framework for cross-training and coordination. IIE Transactions, 36:919-940, 2004.
14. S. G. Kolliopoulos and C. Stein. Approximation algorithms for single-source unsplittable flow. SIAM J. Computing 31:919-946, 2002.
15. A.N. Rybko and A.L. Stolyar. Ergodicity of stochastic processes describing the operation of open queueing networks. Problems of Information Transmission, 28:199-220, 1992.
16. D. B. Shmoys and Tardos. An approximation algorithm for the generalized assignment problem. Mathematical Programming A, Vol. 62(3), pp. 461-474, 1993.
17. M.S. Squillante, C.H. Xia, D.D. Yao, and L. Zhang. Threshold-based priority policies for parallel-server systems with affinity scheduling. Proceedings of the 2001 American Control Conference, 2992-2999, 2001.
18. L. Tassiulas and P.B. Bhattacharya. Allocation of independent resources for maximal throughput. Stochastic Models, 16:27-48, 2000.
19. L. Tassiulas and A. Ephrimedes. 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.
20. E. Zavadlav, J.O. McClain, and L.J. Thomas. Self-buffering, self-balancing, self-flushing production lines. Management Science, 42:1151-1164, 1996.