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

DOI10.1287/STSY.2019.0048zbMath1447.60140OpenAlexW2974220584MaRDI QIDQ5113910

Amy R. Ward

Publication date: 18 June 2020

Published in: Stochastic Systems (Search for Journal in Brave)

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

zbMATH Keywords

optimizationstochastic networksscheduling control

Mathematics Subject Classification ID

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

Related Items (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

Cites Work

• The cμ/θ Rule for Many-Server Queues with Abandonment
• Dynamic Scheduling of a Multiclass Queue in the Halfin-Whitt Heavy Traffic Regime

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