Bounds for a Dynamic-Priority Queue
Published Online:1 Apr 1971https://doi.org/10.1287/opre.19.2.461
- Cited by
- 5 July 2025 | Journal of the Operational Research Society, Vol. 77, No. 5
- 23 December 2015 | Methodology and Computing in Applied Probability, Vol. 19, No. 1
- Operations Research Letters, Vol. 41, No. 6
- International Journal of Production Research, Vol. 32, No. 4
- IEEE Transactions on Communications, Vol. 38, No. 12
- 10 December 2013 | Naval Research Logistics (NRL), Vol. 37, No. 3
- IEEE Transactions on Communications, Vol. 38, No. 5
- Mathematical and Computer Modelling, Vol. 13, No. 3
- Performance Evaluation, Vol. 2, No. 4
- 21 November 2006 | Naval Research Logistics Quarterly, Vol. 26, No. 2
Volume 19, Issue 2
March-April 1971
Pages 257-558
Article Information
Metrics
Information
- Published Online:April 01, 1971
© 1971 INFORMS
Cite as
J. M. Holtzman, (1971) Bounds for a Dynamic-Priority Queue. Operations Research 19(2):461-468.
https://doi.org/10.1287/opre.19.2.461
