Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cµ-Rule
By A. Mandelbaum, Alexander L. Stolyar. Operational Research, 2004
374 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Electrical and Electronic Engineering, Management Information Systems
View Paper: https://www.semanticscholar.org/paper/ad5e29e0b64bbb20f98a1bc47501e91665307dc7
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
In Electrical and Electronic Engineering
In Management Information Systems
Citations in the corpus
- Scheduling a multi class queue with many exponential servers: asymptotic optimality in heavy traffic (2004, background): “(One could, alternatively, increase the number of servers to infinity, which entails an acceleration of the convergence to unity; see the last section of [30].”
- Heavy traffic analysis of open processing networks with complete resource pooling: Asymptotic optimality of discrete review policies (2005, methodology): “Third, we consider linear holding costs, which makes the translation in (c) harder since the optimal controls tend to achieve “corner solutions” in the state space rather than “interior solutions” as in [ 36 , 44].”
- Brownian Inventory Models with Convex Holding Cost, Part 1: Average-Optimal Controls (2013, methodology): “Singular Brownian control has been used to study storage systems [44, 45, 76], multiclass make-to-stock production systems [79, 81] with additional features such as subcontracting [23] or by-products and random yield [66] or parallel server systems with outsourcing and order cancellation, maketo-ord”
- MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic (2004, background): “The Annals of Applied Probability 2004, Vol. 14, No. 1, 1–53 © Institute of Mathematical Statistics, 2004”
- On the dynamic control of matching queues (2014, methodology): “This is a fairly standard requirement in the context of asymptotically optimal control; two closely related instances are [23] and [22]; see also [4, 12].”