论文信息 - A c μ rule for parallel servers with two-tiered c μ preferences

A c μ rule for parallel servers with two-tiered c μ preferences

The cμ rule is known to be optimal in many queueing systems with memoryless service times. We establish a cμ rule for a parallel flexible server system with two tiers. Multiple job classes arrive and wait in separate queues. The first tier contains classes that can only be served by one server and the second tier contains a class that can be served by all servers. The cμ preferences give priority to the first tier. Sequencing decisions are made to minimize linear holding costs. The proofs employ stochastic coupling sample path arguments.

Michael H. Veatch | M. Veatch

[1] J. Walrand,et al. The cμ rule revisited , 1985, Advances in Applied Probability.

[2] J. Harrison. Heavy traffic analysis of a system with parallel servers: asymptotic optimality of discrete-review policies , 1998 .

[3] Ronald J. Williams,et al. Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: asymptotic optimality of a threshold policy , 2001 .

[4] Soroush Saghafian,et al. The “W” network and the dynamic control of unreliable flexible servers , 2011 .

[5] J. V. Mieghem. Dynamic Scheduling with Convex Delay Costs: The Generalized CU Rule , 1995 .

[6] Douglas G. Down. A Call Center Model with Upgrades , 2007 .

[7] Seyed M. R. Iravani,et al. Structural Flexibility: A New Perspective on the Design of Manufacturing and Service Operations , 2005, Manag. Sci..

[8] J. Michael Harrison,et al. Heavy traffic resource pooling in parallel‐server systems , 1999, Queueing Syst. Theory Appl..

[9] Ger Koole,et al. Dynamic control of a single-server system with abandonments , 2011, Queueing Syst. Theory Appl..

[10] J. Baras,et al. Two competing queues with linear costs and geometric service requirements: the μc-rule is often optimal , 1985, Advances in Applied Probability.

[11] Mark S. Squillante,et al. Threshold-based priority policies for parallel-server systems with affinity scheduling , 2001, Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148).