A Service System with Packing Constraints: Greedy Randomized Algorithm Achieving Sublinear in Scale Optimality Gap
Published Online:2 Feb 2021https://doi.org/10.1287/stsy.2019.0067
- Cited by
- 22 June 2025 | Queueing Systems, Vol. 109, No. 3
- 26 August 2024 | Stochastic Systems, Vol. 14, No. 4
- 17 March 2023 | Manufacturing & Service Operations Management, Vol. 25, No. 4
Volume 11, Issue 2
June 2021
Pages 83-192
Article Information
Metrics
Information
- Received:November 10, 2015
- Accepted:July 30, 2019
- Published Online:February 02, 2021
Copyright © 2021, The Author(s)
Cite as
Alexander L. Stolyar, Yuan Zhong (2021) A Service System with Packing Constraints: Greedy Randomized Algorithm Achieving Sublinear in Scale Optimality Gap. Stochastic Systems 11(2):83-111.
https://doi.org/10.1287/stsy.2019.0067
Keywords
