Scheduling in the high uncertainty heavy traffic regime
Rami Atar, Eyal Castiel, Yonatan Shadmi

TL;DR
This paper introduces a model uncertainty approach to heavy traffic queueing systems, analyzing a stochastic game between a scheduler and an adversary under high uncertainty, and derives optimal policies and limits.
Contribution
It develops a novel heavy traffic asymptotic framework accommodating large distributional disturbances using only first two moments, and fully solves the associated stochastic game.
Findings
Optimal scheduling policy is an index rule.
Adversary's optimal strategy depends on current workload.
Limit dynamics are characterized by a discontinuous SDE.
Abstract
We propose a model uncertainty approach to heavy traffic asymptotics that allows for a high level of uncertainty. That is, the uncertainty classes of underlying distributions accommodate disturbances that are of order 1 at the usual diffusion scale, as opposed to asymptotically vanishing disturbances studied previously in relation to heavy traffic. A main advantage of the approach is that the invariance principle underlying diffusion limits makes it possible to define uncertainty classes in terms of the first two moments only. The model we consider is a single server queue with multiple job types. The problem is formulated as a zero sum stochastic game played between the system controller, who determines scheduling and attempts to minimize an expected linear holding cost, and an adversary, who dynamically controls the service time distributions of arriving jobs, and attempts to maximize…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Queuing Theory Analysis · Simulation Techniques and Applications · Transportation Planning and Optimization
