Heavy Traffic Analysis of Dynamic Cyclic Policies: A Unified Treatment of the Single Machine Scheduling Problem
From MaRDI portal
Publication:3634999
DOI10.1287/opre.49.2.246.13530zbMath1163.90499MaRDI QIDQ3634999
Lawrence M. Wein, David M. Markowitz
Publication date: 3 July 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/48049
90B35: Deterministic scheduling theory in operations research
93B20: Minimal systems representations
Related Items
Polling systems with periodic server routeing in heavy traffic: distribution of the delay, Admission policies for the customized stochastic lot scheduling problem with strict due-dates, The stochastic economic lot scheduling problem: a survey, Real-time queues in heavy traffic with earliest-deadline-first queue discipline, Earliest-deadline-first service in heavy-traffic acyclic networks., Polling systems with periodic server routing in heavy traffic: renewal arrivals, Mathematical methods to study the polling systems, Towards a unifying theory on branching-type polling systems in heavy traffic, POLLING SYSTEMS WITH TWO-PHASE GATED SERVICE