IDEAS home Printed from https://ideas.repec.org/r/inm/oropre/v34y1986i1p55-62.html
   My bibliography  Save this item

Deciding Which Queue to Join: Some Counterexamples

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  1. Jazeem Abdul Jaleel & Sherwin Doroudi & Kristen Gardner & Alexander Wickeham, 2022. "A general “power-of-d” dispatching framework for heterogeneous systems," Queueing Systems: Theory and Applications, Springer, vol. 102(3), pages 431-480, December.
  2. Rami Atar & Isaac Keslassy & Gal Mendelson, 2019. "Replicate to the shortest queues," Queueing Systems: Theory and Applications, Springer, vol. 92(1), pages 1-23, June.
  3. Danielle Tibi, 2019. "Martingales and buffer overflow for the symmetric shortest queue model," Queueing Systems: Theory and Applications, Springer, vol. 93(1), pages 153-190, October.
  4. Plinio S. Dester & Christine Fricker & Danielle Tibi, 2017. "Stationary analysis of the shortest queue problem," Queueing Systems: Theory and Applications, Springer, vol. 87(3), pages 211-243, December.
  5. Qi‐Ming He & Jingui Xie & Xiaobo Zhao, 2012. "Priority queue with customer upgrades," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(5), pages 362-375, August.
  6. Athanasia Manou & Antonis Economou & Fikri Karaesmen, 2014. "Strategic Customers in a Transportation Station: When Is It Optimal to Wait?," Operations Research, INFORMS, vol. 62(4), pages 910-925, August.
  7. Olga Bountali & Antonis Economou, 2019. "Strategic customer behavior in a two-stage batch processing system," Queueing Systems: Theory and Applications, Springer, vol. 93(1), pages 3-29, October.
  8. Josh Reed & Yair Shaki, 2015. "A Fair Policy for the G / GI / N Queue with Multiple Server Pools," Mathematics of Operations Research, INFORMS, vol. 40(3), pages 558-595, March.
  9. Hyytiä, Esa & Penttinen, Aleksi & Aalto, Samuli, 2012. "Size- and state-aware dispatching problem with queue-specific job sizes," European Journal of Operational Research, Elsevier, vol. 217(2), pages 357-370.
  10. Parlakturk, Ali & Kumar, Sunil, 2004. "Self-Interested Routing in Queueing Networks," Research Papers 1782r, Stanford University, Graduate School of Business.
  11. Ivo J. B. F. Adan & Onno J. Boxma & Stella Kapodistria & Vidyadhar G. Kulkarni, 2016. "The shorter queue polling model," Annals of Operations Research, Springer, vol. 241(1), pages 167-200, June.
  12. Jori Selen & Ivo Adan & Stella Kapodistria & Johan Leeuwaarden, 2016. "Steady-state analysis of shortest expected delay routing," Queueing Systems: Theory and Applications, Springer, vol. 84(3), pages 309-354, December.
  13. V.D. Dinopoulou & C. Melolidakis, 2001. "Asymptotically optimal component assembly plans in repairable systems and server allocation in parallel multiserver queues," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(8), pages 732-746, December.
  14. A. Wang & I. Ziedins, 2018. "Probabilistic selfish routing in parallel batch and single-server queues," Queueing Systems: Theory and Applications, Springer, vol. 88(3), pages 389-407, April.
  15. Zhang, Zhongju & Daigle, John, 2012. "Analysis of job assignment with batch arrivals among heterogeneous servers," European Journal of Operational Research, Elsevier, vol. 217(1), pages 149-161.
  16. Rob Shone & Vincent A. Knight & Paul R. Harper, 2020. "A conservative index heuristic for routing problems with multiple heterogeneous service facilities," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 92(3), pages 511-543, December.
  17. Yan Chen & Ward Whitt, 2020. "Algorithms for the upper bound mean waiting time in the GI/GI/1 queue," Queueing Systems: Theory and Applications, Springer, vol. 94(3), pages 327-356, April.
  18. Jazeem Abdul Jaleel & Sherwin Doroudi & Kristen Gardner, 2024. "Queue-length-aware dispatching in large-scale heterogeneous systems," Queueing Systems: Theory and Applications, Springer, vol. 108(1), pages 125-184, October.
  19. Sarang Deo & Itai Gurvich, 2011. "Centralized vs. Decentralized Ambulance Diversion: A Network Perspective," Management Science, INFORMS, vol. 57(7), pages 1300-1319, July.
  20. P S Ansell & K D Glazebrook & C Kirkbride, 2003. "Generalised ‘join the shortest queue’ policies for the dynamic routing of jobs to multi-class queues," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(4), pages 379-389, April.
  21. Legros, Benjamin & Jouini, Oualid, 2019. "On the scheduling of operations in a chat contact center," European Journal of Operational Research, Elsevier, vol. 274(1), pages 303-316.
  22. Hassin, Refael & Roet-Green, Ricky, 2018. "Cascade equilibrium strategies in a two-server queueing system with inspection cost," European Journal of Operational Research, Elsevier, vol. 267(3), pages 1014-1026.
  23. Hong Chen & Heng-Qing Ye, 2012. "Asymptotic Optimality of Balanced Routing," Operations Research, INFORMS, vol. 60(1), pages 163-179, February.
  24. Fernanda Campello & Armann Ingolfsson & Robert A. Shumsky, 2017. "Queueing Models of Case Managers," Management Science, INFORMS, vol. 63(3), pages 882-900, March.
  25. Ali K. Parlaktürk & Sunil Kumar, 2004. "Self-Interested Routing in Queueing Networks," Management Science, INFORMS, vol. 50(7), pages 949-966, July.
  26. Tolga Tezcan, 2008. "Optimal Control of Distributed Parallel Server Systems Under the Halfin and Whitt Regime," Mathematics of Operations Research, INFORMS, vol. 33(1), pages 51-90, February.
  27. Fernanda Campello & Armann Ingolfsson & Robert A. Shumsky, 2018. "Queueing Models of Case Managers," Management Science, INFORMS, vol. 64(1), pages 7-26, January.
  28. Senthil Veeraraghavan & Laurens Debo, 2009. "Joining Longer Queues: Information Externalities in Queue Choice," Manufacturing & Service Operations Management, INFORMS, vol. 11(4), pages 543-562, April.
  29. Coolen, F. P. A. & Coolen-Schrijner, P., 2003. "A nonparametric predictive method for queues," European Journal of Operational Research, Elsevier, vol. 145(2), pages 425-442, March.
  30. Esther Frostig & Benny Levikson, 1999. "Optimal Routing of Customers to Two Parallel Heterogeneous Servers: The Case of IHR Service Times," Operations Research, INFORMS, vol. 47(3), pages 438-444, June.
  31. Yi Ouyang & Demosthenis Teneketzis, 2022. "Signaling for decentralized routing in a queueing network," Annals of Operations Research, Springer, vol. 317(2), pages 737-775, October.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.