SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Optimality of the Stochastic Earliest Deadline Policy for the G/M/c Queue Serving Customers with Deadlines
0 references·2 citing·6 second hop
Optimality of the Stochastic Earliest Deadline Policy for the G/M/c Queue Serving Customers with Deadlines (1991)Optimality of the Stochastic Earliest Dea…Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performance Study (2005)Non-Preemptive Earliest-Deadl…Sample Path Criteria for Weak Majorization (1994)Sample Path Criteria for Weak…Point Processes and Queues (1981)Introduction to Queueing Networks (1987)An Introduction to Queueing Networks (1990)Single-server queues with impatient customers (1984)Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service (1988)Real-time queueing theory (2002)
this work references cited by second hop

References

No references inside the corpus for this window.

Cited by

  • 2005Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performance Study38 cited
  • 1994Sample Path Criteria for Weak Majorization19 cited

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