Abstract
Dynamic scheduling of multi-class jobs in queueing systems has wide ranging applications, but in general is a very difficult control problem. Here we focus on a class of systems for which conservation laws hold. Consequently, the performance space becomes a polymatroid — a polytope witha matroid-like structure, withall the vertices corresponding to the performance under priority rules, and all the vertices are easily identified. This structure translates the optimal control problem to an optimization problem, which, under a linear objective, becomes a special linear program; and the optimal schedule is a priority rule. In a more general setting, conservation laws extend to so-called generalized conservation laws, under which the performance space becomes more involved; however, the basic structure that ensures the optimality of priority rules remains intact. This tutorial provides an overview to the subject, focusing on the main ideas, basic mathematical facts, and computational implications.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Asmussen, S., Applied Probability and Queues. Wiley, Chichester, U.K., 1987.
Bertsimas, D., The Achievable Region Method in the Optimal Control of Queueing Systems; Formulations, Bounds and Policies. Queueing Systems, 21 (1995), 337–389.
Bertsimas, D. and Niño-Mora, J., Conservation Laws, Extended Polymatroid and Multi-Armed Bandit Problems: A Unified Approachto Indexable Systems. Mathematics of Operations Research, 21 (1996), 257–306.
Bertsimas, D. Paschalidis, I.C. and Tsitsiklis, J.N., Optimization of Multiclass Queueing Networks: Polyhedral and Nonlinear Characterization of Achievable Performance. Ann. Appl. Prob., 4 (1994), 43–75.
Baras, J.S., Dorsey, A.J. and Makowski, A.M., Two Competing Queues withLinear Cost: the μc Rule Is Often Optimal. Adv. Appl. Prob., 17 (1985), 186–209.
Buyukkoc, C., Varaiya, P. and Walrand, J., The cμ Rule Revisited. Adv. Appl. Prob., 30 (1985), 237–238.
Chen, H. and Yao, D.D., Fundamentals of Queueing Networks: Performance, Asymptotics and Optimization. Springer-Verlag, New York, 2001.
Chvátal, V., Linear Programming. W.H. Freeman, New York, 1983.
Coffman, E. and Mitrani, I., A Characterization of Waiting Time Performance Realizable by Single Server Queues. Operations Research, 28 (1980), 810–821.
Cox, D.R. and Smith, W.L., Queues. Methunen, London, 1961.
Dacre, K.D., Glazebrook, K.D., and Ninõ-Mora, J., The Achievable Region Approach to the Optimal Control of Stochastic Systems. J. Royal Statist. Soc. (1999).
Dunstan, F.D.J. and Welsh, D.J.A., A Greedy Algorithm for Solving a Certain Class of Linear Programmes. Math. Programming, 5 (1973), 338–353.
Edmonds, J., Submodular Functions, Matroids and Certain Polyhedra. Proc. Int. Conf. on Combinatorics (Calgary), Gordon and Breach, New York, 69–87, 1970.
Federgruen, A. and Groenevelt, H., The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality. Operations Res., 34 (1986), 909–918.
Federgruen, A. and Groenevelt, H., The Impact of the Composition of the Customer Base in General Queueing Models. J. Appl. Prob., 24 (1987), 709–724.
Federgruen, A. and Groenevelt, H., M/G/c Queueing Systems withMultiple Customer Classes: Characterization and Control of Achievable Performance under Non-Preemptive Priority Rules. Management Science, 34 (1988), 1121–1138.
Federgruen, A. and Groenevelt, H., Characterization and Optimization of Achievable Performance in Queueing Systems. Operations Res., 36 (1988), 733–741.
Fong, L.L. and Squillante, M.S., Time-Function Scheduling: A General Approach to Controllable Resource Management. IBM Research Report RC-20155, IBM Research Division, T.J. Watson Research Center, Yorktown Hts., New York, NY 10598, 1995.
Franaszek, P.A. and Nelson, R.D., Properties of Delay Cost Scheduling in Timesharing Systems. IBM Research Report RC-13777, IBM Research Division, T.J. Watson Research Center, Yorktown Hts., New York, NY 10598, 1990.
Gelenbe, E. and Mitrani, I., Analysis and Synthesis of Computer Systems. Academic Press, London, 1980.
Gittins, J.C., Bandit Processes and Dynamic Allocation Indices (withdiscussions). J. Royal Statistical Society, Ser. B, 41 (1979), 148–177.
Gittins, J.C., Multiarmed Bandit Allocation Indices. Wiley, Chichester, 1989.
Gittins, J.C. and Jones, D.M., A Dynamic Allocation Index for the Sequential Design of Experiments. In: Progress in Statistics: European Meeting of Statisticians, Budapest, 1972, J. Gani, K. Sarkadi and I. Vince (eds.), North-Holland, Amsterdam, 1974, 241–266.
Glasserman, P. and Yao, D.D., Monotone Structure in Discrete-Event Systems. Wiley, New York, 1994.
Glasserman, P. and Yao, D.D., Monotone Optimal Control of Permutable GSMP’s. Mathematics of Operations Research, 19 (1994), 449–476.
Grötschel, M., Lovász, L and Schrijver, A., Geometric Algorithms and Combinatorial Optimization, second corrected edition. Springer-Verlag, Berlin, 1993.
Harrison, J.M., Dynamic Scheduling of a Multiclass Queue: Discount Optimality. Operations Res., 23 (1975), 270–282.
Harrison, J.M., The BIGSTEP Approach to Flow Management in Stochastic Processing Networks. In: Stochastic Networks: Theory and Applications, Kelly, Zachary, and Ziedens (eds.), Royal Statistical Society Lecture Note Series, #4, 1996, 57–90.
Harrison, J.M. and Wein, L., Scheduling Networks of Queues: Heavy Traffic Analysis of a Simple Open Network. Queueing Systems, 5 (1989), 265–280.
Kleinrock, L., A Delay Dependent Queue Discipline. Naval Research Logistics Quarterly, 11 (1964), 329–341.
Kleinrock, L., Queueing Systems, Vol. 2. Wiley, New York, 1976.
Klimov, G.P., Time Sharing Service Systems, Theory of Probability and Its Applications, 19 (1974), 532–551 (Part I) and 23 (1978), 314-321 (Part II).
Lai, T.L. and Ying, Z., Open Bandit Processes and Optimal Scheduling of Queueing Networks. Adv. Appl. Prob., 20 (1988), 447–472.
Lu, Y., Dynamic Scheduling of Stochastic Networks with Side Constraints. Ph.D. Thesis, Columbia University, 1998.
Meilijson, I. and Weiss, G., Multiple Feedback at a Single-Server Station. Stochastic Proc. and Appl., 5 (1977), 195–205.
Ross, K.W. and Yao, D.D., Optimal Dynamic Scheduling in Jackson Networks. IEEE Transactions on Automatic Control, 34 (1989), 47–53.
Ross, K.W. and Yao, D.D., Optimal Load Balancing and Scheduling in a Distributed Computer System. Journal of the Association for Computing Machinery, 38 (1991), 676–690.
Shanthikumar, J.G. and Sumita, U., Convex Ordering of Sojourn Times in Single-Server Queues: Extremal Properties of FIFO and LIFO Service Disciplines. J. Appl. Prob., 24 (1987), 737–748.
Shanthikumar J.G. and Yao D.D., Multiclass Queueing Systems: Polymatroid Structure and Optimal Scheduling Control. Operation Research, 40 (1992), Supplement 2, S293–299.
Smith, W.L., Various Optimizers for Single-Stage Production. Naval Research Logistics Quarterly, 3 (1956), 59–66.
Tcha, D. and Pliska, S.R., Optimal Control of Single-Server Queueing Networks and Multiclass M/G/1 Queues with Feedback. Operations Research, 25 (1977), 248–258.
Tsoucas, P., The Region of Achievable Performance in a Model of Klimov. IBM Research Report RC-16543, IBM Research Division, T.J. Watson Research Center, Yorktown Hts., New York, NY 10598, 1991.
Varaiya, P., Walrand, J. and Buyyokoc, C., Extensions of the Multiarmed Bandit Problem: The Discounted Case. IEEE Trans. Automatic Control, 30 (1985), 426–439.
Weber, R., On the Gittins Index for Multiarmed Bandits. Annals of Applied Probability, (1992), 1024–1033.
Weber, R. and Stidham, S., Jr., Optimal Control of Service Rates in Networks of Queues. Adv. Appl. Prob., 19 (1987), 202–218.
Weiss, G., Branching Bandit Processes. Probability in the Engineering and Informational Sciences, 2 (1988), 269–278.
Welsh, D., Matroid Theory, (1976), Academic Press, London.
Whittle, P., Multiarmed Bandits and the Gittins Index. J. Royal Statistical Society, Ser. B, 42 (1980), 143–149.
Whittle, P., Optimization over Time: Dynamic Programming and Stochastic Control, vols. I, II, Wiley, Chichester, 1982.
Yao, D.D. and Shanthikumar, J.G., Optimal Scheduling Control of a Flexible Machine. IEEE Trans. on Robotics and Automation, 6 (1990), 706–712.
Yao, D.D. and Zhang, L., Stochastic Scheduling and Polymatroid Optimization, Lecture Notes in Applied Mathematics, 33, G. Ying and Q. Zhang (eds.), Springer-Verlag, 1997, 333–364.
Zhang, L., Reliability and Dynamic Scheduling in Stochastic Networks. Ph.D. Thesis, Columbia University, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yao, D.D. (2002). Dynamic Scheduling via Polymatroid Optimization. In: Calzarossa, M.C., Tucci, S. (eds) Performance Evaluation of Complex Systems: Techniques and Tools. Performance 2002. Lecture Notes in Computer Science, vol 2459. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45798-4_5
Download citation
DOI: https://doi.org/10.1007/3-540-45798-4_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44252-3
Online ISBN: 978-3-540-45798-5
eBook Packages: Springer Book Archive