Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

Earliest-deadline-first service in heavy-traffic acyclic networks

5 references·3 citing·32 second hop

FromToDepth

this work references cited by second hop

References

1995Dynamic Scheduling with Convex Delay Costs: The Generalized $c|mu$ Rule277 cited
1998Diffusion approximations for open multiclass queueing networks: sufficient conditions involving state space collapse264 cited
2001Real-time queues in heavy traffic with earliest-deadline-first queue discipline146 cited
1991A Heavy Traffic Limit Theorem for Networks of Queues with Multiple Customer Types103 cited
2001Stability of Earliest-Due-Date, First-Served Queueing Networks65 cited

Cited by

2005Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performance Study38 cited
2016Stochastic Processing Networks25 cited
2003Multiple-input heavy-traffic real-time queues20 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work