Open Problem—Regarding Static Priority Scheduling for Many-Server Queues with Reneging

DOI10.1287/STSY.2019.0048MaRDI QIDQ5113910zbMATH OpenOpenAlexFDO

Authors Amy R. Ward

Publication date 18 June 2020

Published in Stochastic Systems (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1287/stsy.2019.0048

zbMATH Keywords

optimizationstochastic networksscheduling control

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)

Cites work

• Dynamic Scheduling of a Multiclass Queue in the Halfin-Whitt Heavy Traffic Regime
• The \(c\mu /\theta \) rule for many-server queues with abandonment

Cited in

(1)

• Introduction to the Applied Probability Society’s “Open Problems in Applied Probability” Session at the INFORMS Annual Meeting, Phoenix, Arizona, November 4–7, 2018

This page was built for publication: Open Problem—Regarding Static Priority Scheduling for Many-Server Queues with Reneging

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5113910)