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

Published Online:https://doi.org/10.1287/stsy.2019.0048

References

  • Atar R, Giat C, Shimkin N (2010) The cμ/θ rule for many-server queues with abandonment. Oper. Res. 58(5):1427–1439.LinkGoogle Scholar
  • Braverman A, Gurvich I, Huang J (2019) On the Taylor expansion of value functions. Oper. Res. Forthcoming.Google Scholar
  • Harrison JM, Zeevi A (2004) Dynamic scheduling of a multiclass queue in the Halfin-Whitt heavy traffic regime. Oper. Res. 52(2):243–257.LinkGoogle Scholar
  • Kim J, Randhawa RS, Ward AR (2018) Dynamic scheduling in a many-server multi-class system: The role of customer impatience in large systems. Manufacturing Service Oper. Management 20(2):285–301.LinkGoogle Scholar
  • Puha A, Ward AR (2019) Scheduling an overloaded multiclass many-server queue with impatient customers. TutORials Oper. Res. (INFORMS, Catonsville, MD), 189–217.Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.