IDEAS home Printed from https://ideas.repec.org/a/spr/queues/v100y2022i3d10.1007_s11134-022-09818-y.html
   My bibliography  Save this article

Routing with too much information?

Author

Listed:
  • Esa Hyytiä

    (University of Iceland)

  • Peter Jacko

    (Lancaster University
    Berry Consultants)

  • Rhonda Righter

    (UC Berkeley)

Abstract

No abstract is available for this item.

Suggested Citation

  • Esa Hyytiä & Peter Jacko & Rhonda Righter, 2022. "Routing with too much information?," Queueing Systems: Theory and Applications, Springer, vol. 100(3), pages 441-443, April.
    • Handle: RePEc:spr:queues:v:100:y:2022:i:3:d:10.1007_s11134-022-09818-y
    DOI: 10.1007/s11134-022-09818-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11134-022-09818-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11134-022-09818-y?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Zhen Liu & Rhonda Righter, 1998. "Optimal Load Balancing on Distributed Homogeneous Unreliable Processors," Operations Research, INFORMS, vol. 46(4), pages 563-573, August.
    2. Daley, D. J., 1987. "Certain optimality properties of the first-come first-served discipline for G/G/s queues," Stochastic Processes and their Applications, Elsevier, vol. 25, pages 301-308.
    3. 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.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. L. D. Servi & S. Humair, 1999. "Optimizing Bernoulli Routing Policies for Balancing Loads on Call Centers and Minimizing Transmission Costs," Journal of Optimization Theory and Applications, Springer, vol. 100(3), pages 623-659, March.
    2. Habib, Ahsan, 2008. "The role of accruals and cash flows in explaining security returns: Evidence from New Zealand," Journal of International Accounting, Auditing and Taxation, Elsevier, vol. 17(1), pages 51-66.
    3. Saif Benjaafar & Yanzhi Li & Dongsheng Xu & Samir Elhedhli, 2008. "Demand Allocation in Systems with Multiple Inventory Locations and Multiple Demand Sources," Manufacturing & Service Operations Management, INFORMS, vol. 10(1), pages 43-60, October.
    4. Arie Hordijk & Dinard van der Laan, 2005. "On the Average Waiting Time for Regular Routing to Deterministic Queues," Mathematics of Operations Research, INFORMS, vol. 30(2), pages 521-544, May.
    5. 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.
    6. Dinard van der Laan, 2015. "Assigning Multiple Job Types to Parallel Specialized Servers," Tinbergen Institute Discussion Papers 15-102/III, Tinbergen Institute.
    7. Olivier Bilenne, 2021. "Dispatching to parallel servers," Queueing Systems: Theory and Applications, Springer, vol. 99(3), pages 199-230, December.
    8. Saif Benjaafar & Mohsen ElHafsi & Francis de Véricourt, 2004. "Demand Allocation in Multiple-Product, Multiple-Facility, Make-to-Stock Systems," Management Science, INFORMS, vol. 50(10), pages 1431-1448, October.
    9. Er-Rahmadi, Btissam & Ma, Tiejun, 2022. "Data-driven mixed-Integer linear programming-based optimisation for efficient failure detection in large-scale distributed systems," European Journal of Operational Research, Elsevier, vol. 303(1), pages 337-353.
    10. 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.
    11. Down, Douglas G. & Lewis, Mark E., 2006. "Dynamic load balancing in parallel queueing systems: Stability and optimal control," European Journal of Operational Research, Elsevier, vol. 168(2), pages 509-519, January.
    12. 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.
    13. Zhong, Zhiheng & Cao, Ping, 2023. "Balanced routing with partial information in a distributed parallel many-server queueing system," European Journal of Operational Research, Elsevier, vol. 304(2), pages 618-633.
    14. K.D. Glazebrook & C. Kirkbride, 2004. "Index policies for the routing of background jobs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(6), pages 856-872, September.
    15. Eitan Altman & Bruno Gaujal & Arie Hordijk, 2000. "Multimodularity, Convexity, and Optimization Properties," Mathematics of Operations Research, INFORMS, vol. 25(2), pages 324-347, May.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:queues:v:100:y:2022:i:3:d:10.1007_s11134-022-09818-y. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.