Parallel Scheduling of Multiclass M/M/m Queues: Approximate and Heavy-Traffic Optimization of Achievable Performance

References

• Bertsimas D., Niño-Mora J. Conservation laws, extended polymatroids and multi-armed bandit problems: a polyhedral approach to indexable systems. Math. Oper. Res. (1996) 21:257–306Link, Google Scholar
• Bertsimas D., Niño-Mora J. Optimization of multiclass queueing networks with changeover times via the achievable region approach: Part I, the single-station case. Math. Oper. Res. (1999a) 24:306–330Link, Google Scholar
• Bertsimas D., Niño-Mora J. Optimization of multiclass queueing networks with changeover times via the achievable region approach: Part II, the multi-station case. Math. Oper. Res. (1999b) 24:331–361Link, Google Scholar
• Bertsimas D., Paschalidis I. C., Tsitsiklis J. N. Optimization of multiclass queueing networks: Polyhedral and nonlinear characterizations of achievable performance. Ann. Appl. Probab. (1994) 4:43–75Crossref, Google Scholar
• Boxma O. J. Workloads and waiting times in single-server systems with multiple customer classes. Queueing Syst. (1989) 5:185–214Crossref, Google Scholar
• Burke P. J. The output of a queueing system. Oper. Res. (1956) 4:699–704Link, Google Scholar
• Coffman E., Mitrani I. A characterization of waiting time performance realizable by single server queues. Oper. Res. (1980) 28:810–821Link, Google Scholar
• Federgruen A., Groenevelt H. Characterization and optimization of achievable performance in general queueing systems. Oper. Res. (1988) 36:733–741Link, Google Scholar
• Finch P. D. On the distribution of queue size in queueing problems. Acta Math. Hungar. (1959) 10:327–336Crossref, Google Scholar
• Gelenbe E., Mitrani I.Analysis and Synthesis of Computer Systems (1980) (Academic Press, London) Google Scholar
• Gittins J. C., Jones D. M., Gani J., Sarkadi K., Vince I. A dynamic allocation index for the sequential design of experiments. Progress in Statistics: European Meeting of Statisticians, Budapest, 1972 (1974) (North-Holland, Amsterdam) 241–266Google Scholar
• Glazebrook K. D., Garbe R. Almost optimal policies for stochastic systems which almost satisfy conservation laws. Ann. Oper. Res. (1999) 92:19–43Crossref, Google Scholar
• Glazebrook K. D., Niño-Mora J., Burkard R., Woeginger G. Scheduling multi-class queueing networks on parallel servers: approximate and heavy-traffic optimality of Klimov's rule. Algorithms—ESA 97 (1997) 232–245volume 1284 of Spinger Lecture Notes in Computer ScienceCrossref, Google Scholar
• Glazebrook K. D., Niño-Mora J. A linear programming approach to stability, optimization and performance analysis for Markovian queueing networks. Ann. Oper. Res. (1999) 92:1–18Crossref, Google Scholar
• Harrison J. M. Heavy traffic analysis of a system with parallel servers: asymptotic optimality of discrete-review policies. Ann. Appl. Probab. (1998) 8:822–848Crossref, Google Scholar
• Kelly F. P., Laws C. N. Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling. Queueing Syst. Theory Appl. (1993) 13:47–86Crossref, Google Scholar
• Klimov G. P. Time sharing service systems I. Theory Probab. Appl. (1974) 19:532–551Crossref, Google Scholar
• Klimov G. P. Time sharing service systems II. Theory Probab. Appl. (1978) 23:314–321Crossref, Google Scholar
• Kumar S., Kumar P. R. Performance bounds for queueing networks and scheduling policies. IEEE Trans. Autom. Control (1994) 39:1600–1611Crossref, Google Scholar
• Papangelou F. Integrability of expected increments of point processes and a related random change of time scale. Trans. Amer. Math. Soc. (1972) 165:483–506Crossref, Google Scholar
• Ross K. W., Yao D. D. Optimal dynamic scheduling in Jackson networks. IEEE Trans. Aut. Control (1989) 34:47–53Crossref, Google Scholar
• Shanthikumar J. G., Yao D. D. Multi-class queueing systems: polyhedral structure and optimal scheduling control. Oper. Res. (1992) 40:293–299Link, Google Scholar
• Smith W. E. Various optimizers for single stage production. Naval Res. Logist. Quart. (1956) 3:59–66Crossref, Google Scholar
• Tsoucas P. The region of achievable performance in a model of Klimov. (1991) . Technical Report RC16543, IBM T.J. Watson Research Center, Yorktown Heights, NYGoogle Scholar
• Weiss G., Queyranne M. Approximation results in parallel machines stochastic scheduling. Ann. Oper. Res. (1990) 26:195–242Special Volume on Production Planning and SchedulingCrossref, Google Scholar
• Weiss G. Turnpike optimality of Smith's rule in parallel machines stochastic scheduling. Math. Oper. Res. (1992) 17:255–270Link, Google Scholar
• Weiss G. On almost optimal priority rules for preemptive scheduling of stochastic jobs on parallel machines. Adv. Appl. Probab. (1995) 27:821–839Crossref, Google Scholar