IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v255y2016i2p333-344.html
   My bibliography  Save this article

Allocation of flows in closed bipartite queueing networks

Author

Listed:
  • Brooks, James D.
  • Kar, Koushik
  • Mendonça, David J.

Abstract

This paper describes a novel method for allocating agents to routes in a closed bipartite queueing network to maximize system throughput using three open network approximations. Results are presented which compare this method with known prior work and optimal solutions to provide an empirical optimality gap. Average empirical optimality gaps of 1.29 percent, 1.13 percent and 1.29 percent are observed for the three approximations considered. Further, because many systems are under the control of rational agents, conditions are derived in order to determine properties of the market context that induce optimal behavior. It is shown that uniform rewards do not yield an efficient rational equilibrium in general. However, for systems with homogeneous servers and travel times or those with travel times that are much larger than queue waiting times, uniform rewarding is optimal.

Suggested Citation

  • Brooks, James D. & Kar, Koushik & Mendonça, David J., 2016. "Allocation of flows in closed bipartite queueing networks," European Journal of Operational Research, Elsevier, vol. 255(2), pages 333-344.
    • Handle: RePEc:eee:ejores:v:255:y:2016:i:2:p:333-344
    DOI: 10.1016/j.ejor.2016.05.017
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037722171630337X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2016.05.017?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. Daniel Adelman, 2007. "Price-Directed Control of a Closed Logistics Queueing Network," Operations Research, INFORMS, vol. 55(6), pages 1022-1038, December.
    2. Colin E. Bell & Shaler Stidham, Jr., 1983. "Individual versus Social Optimization in the Allocation of Customers to Alternative Servers," Management Science, INFORMS, vol. 29(7), pages 831-839, July.
    3. Morabito, Reinaldo & de Souza, Mauricio C. & Vazquez, Mariana, 2014. "Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks," European Journal of Operational Research, Elsevier, vol. 232(3), pages 618-629.
    4. Bakuli, David L. & MacGregor Smith, J., 1996. "Resource allocation in state-dependent emergency evacuation networks," European Journal of Operational Research, Elsevier, vol. 89(3), pages 543-555, March.
    5. Naor, P, 1969. "The Regulation of Queue Size by Levying Tolls," Econometrica, Econometric Society, vol. 37(1), pages 15-24, January.
    6. A. Hordijk & J. A. Loeve, 2000. "Optimal static customer routing in a closed queuing network," Statistica Neerlandica, Netherlands Society for Statistics and Operations Research, vol. 54(2), pages 148-159, July.
    7. Xia, Li & Shihada, Basem, 2015. "A Jackson network model and threshold policy for joint optimization of energy and delay in multi-hop wireless networks," European Journal of Operational Research, Elsevier, vol. 242(3), pages 778-787.
    8. Janusz Filipiak, 1984. "Dynamic Routing in a Queueing System with a Multiple Service Facility," Operations Research, INFORMS, vol. 32(5), pages 1163-1180, October.
    9. Ali K. Parlaktürk & Sunil Kumar, 2004. "Self-Interested Routing in Queueing Networks," Management Science, INFORMS, vol. 50(7), pages 949-966, July.
    10. Grossman, Thomas A. & Brandeau, Margaret L., 2002. "Optimal pricing for service facilities with self-optimizing customers," European Journal of Operational Research, Elsevier, vol. 141(1), pages 39-57, August.
    11. D. J. Houck, 1987. "Comparison of Policies for Routing Customers to Parallel Queueing Systems," Operations Research, INFORMS, vol. 35(2), pages 306-310, April.
    12. Joel M. Calabrese, 1992. "Optimal Workload Allocation in Open Networks of Multiserver Queues," Management Science, INFORMS, vol. 38(12), pages 1792-1802, December.
    13. Parlakturk, Ali & Kumar, Sunil, 2004. "Self-Interested Routing in Queueing Networks," Research Papers 1782r, Stanford University, Graduate School of Business.
    14. Delasay, Mohammad & Kolfal, Bora & Ingolfsson, Armann, 2012. "Maximizing throughput in finite-source parallel queue systems," European Journal of Operational Research, Elsevier, vol. 217(3), pages 554-559.
    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. Alessandro Arlotto & Andrew E. Frazelle & Yehua Wei, 2019. "Strategic Open Routing in Service Networks," Management Science, INFORMS, vol. 65(2), pages 735-750, February.
    2. Lauren Xiaoyuan Lu & Jan A. Van Mieghem & R. Canan Savaskan, 2009. "Incentives for Quality Through Endogenous Routing," Manufacturing & Service Operations Management, INFORMS, vol. 11(2), pages 254-273, July.
    3. Shiliang Cui & Xuanming Su & Senthil Veeraraghavan, 2019. "A Model of Rational Retrials in Queues," Operations Research, INFORMS, vol. 67(6), pages 1699-1718, November.
    4. David Barbato & Alberto Cesaro & Bernardo D’Auria, 2024. "Equilibrium Strategies for Overtaking-Free Queueing Networks under Partial Information," Mathematics, MDPI, vol. 12(19), pages 1-17, September.
    5. René Caldentey & Lawrence M. Wein, 2006. "Revenue Management of a Make-to-Stock Queue," Operations Research, INFORMS, vol. 54(5), pages 859-875, October.
    6. Jalili Marand, Ata & Hoseinpour, Pooya, 2024. "A congested facility location problem with strategic customers," European Journal of Operational Research, Elsevier, vol. 318(2), pages 442-456.
    7. Parlakturk, Ali & Kumar, Sunil, 2004. "Self-Interested Routing in Queueing Networks," Research Papers 1782r, Stanford University, Graduate School of Business.
    8. Roberto Cominetti & José R. Correa & Nicolás E. Stier-Moses, 2009. "The Impact of Oligopolistic Competition in Networks," Operations Research, INFORMS, vol. 57(6), pages 1421-1437, December.
    9. Vasiliki Kostami & Amy R. Ward, 2009. "Managing Service Systems with an Offline Waiting Option and Customer Abandonment," Manufacturing & Service Operations Management, INFORMS, vol. 11(4), pages 644-656, November.
    10. Gérard P. Cachon & Patrick T. Harker, 2002. "Competition and Outsourcing with Scale Economies," Management Science, INFORMS, vol. 48(10), pages 1314-1333, October.
    11. Barış Ata & Anton Skaro & Sridhar Tayur, 2017. "OrganJet: Overcoming Geographical Disparities in Access to Deceased Donor Kidneys in the United States," Management Science, INFORMS, vol. 63(9), pages 2776-2794, September.
    12. Knight, Vincent A. & Harper, Paul R., 2013. "Selfish routing in public services," European Journal of Operational Research, Elsevier, vol. 230(1), pages 122-132.
    13. Xuanming Su & Stefanos Zenios, 2004. "Patient Choice in Kidney Allocation: The Role of the Queueing Discipline," Manufacturing & Service Operations Management, INFORMS, vol. 6(4), pages 280-301, June.
    14. Mei Xue & Patrick T. Harker, 2003. "Service Co-Production, Customer Efficiency and Market Competition," Center for Financial Institutions Working Papers 03-03, Wharton School Center for Financial Institutions, University of Pennsylvania.
    15. 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.
    16. Lauren Xiaoyuan Lu & Jan A. Van Mieghem & R. Canan Savaskan, 2006. "Incentives for Quality through Endogenous Routing," Discussion Papers 1436, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    17. Refael Hassin & Yair Y. Shaki & Uri Yovel, 2015. "Optimal service‐capacity allocation in a loss system," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(2), pages 81-97, March.
    18. Ghosh, Souvik & Hassin, Refael, 2021. "Inefficiency in stochastic queueing systems with strategic customers," European Journal of Operational Research, Elsevier, vol. 295(1), pages 1-11.
    19. Shone, Rob & Knight, Vincent A. & Williams, Janet E., 2013. "Comparisons between observable and unobservable M/M/1 queues with respect to optimal customer behavior," European Journal of Operational Research, Elsevier, vol. 227(1), pages 133-141.
    20. S. Rao & E. R. Petersen, 1998. "Optimal Pricing of Priority Services," Operations Research, INFORMS, vol. 46(1), pages 46-56, February.

    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:eee:ejores:v:255:y:2016:i:2:p:333-344. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.