Heavy Traffic Analysis of Dynamic Cyclic Policies: A Unified Treatment of the Single Machine Scheduling Problem

DOI10.1287/opre.49.2.246.13530zbMath1163.90499OpenAlexW2006020206MaRDI QIDQ3634999

David M. Markowitz, Lawrence M. Wein

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

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Minimal systems representations (93B20)

Related Items (11)

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 ⋮ Order Now, Pickup in 30 Minutes: Managing Queues with Static Delivery Guarantees ⋮ The stochastic economic lot scheduling problem: a survey ⋮ POLLING SYSTEMS WITH TWO-PHASE GATED SERVICE ⋮ Mathematical methods to study the polling systems ⋮ Towards a unifying theory on branching-type polling systems in heavy traffic ⋮ Admission policies for the customized stochastic lot scheduling problem with strict due-dates ⋮ Polling systems with periodic server routeing in heavy traffic: distribution of the delay ⋮ Heavy traffic analysis of roving server networks

This page was built for publication: Heavy Traffic Analysis of Dynamic Cyclic Policies: A Unified Treatment of the Single Machine Scheduling Problem