IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v62y2016i3p899-903.html
   My bibliography  Save this article

On Socially Optimal Queue Length

Author

Listed:
  • Chia-Li Wang

    (Department of Applied Mathematics, National Dong Hwa University, Hualien 97401, Taiwan, Republic of China)

Abstract

Suppose customers arrive at an observable queueing system for service with a utility function of reward and waiting cost. The self- (customer) decision is whether to queue or balk, and the social (system administrator) goal is to maximize the profit of the whole system. Whereas the self-optimal policy is relatively easy to obtain, the socially optimal policy, which is of more practical importance, often requires a tedious and ad hoc analysis as a result of external effects. We will introduce a simple and general approach to determine the optimal admission policy. The main idea of this approach is to consider a special rule that admits an extra customer who is served only by the surplus capacity and bears all the increased waiting time and thus incurs no external cost. The approach applies in principle to queues with exponential service. In fact, for such queues, a marginal analysis based on this rule will explore the properties of the optimal social policy and lead to a general procedure for deriving the optimal threshold. This paper was accepted by Noah Gans, stochastic models and simulation .

Suggested Citation

  • Chia-Li Wang, 2016. "On Socially Optimal Queue Length," Management Science, INFORMS, vol. 62(3), pages 899-903, March.
  • Handle: RePEc:inm:ormnsc:v:62:y:2016:i:3:p:899-903
    DOI: 10.1287/mnsc.2014.2148
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.2014.2148
    Download Restriction: no

    File URL: https://libkey.io/10.1287/mnsc.2014.2148?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
    ---><---

    References listed on IDEAS

    as
    1. Hassin, Refael, 1985. "On the Optimality of First Come Last Served Queues," Econometrica, Econometric Society, vol. 53(1), pages 201-202, January.
    2. Uri Yechiali, 1972. "Customers' Optimal Joining Rules for the GI/M/s Queue," Management Science, INFORMS, vol. 18(7), pages 434-443, March.
    3. Naor, P, 1969. "The Regulation of Queue Size by Levying Tolls," Econometrica, Econometric Society, vol. 37(1), pages 15-24, January.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Refael Hassin & Ran I. Snitkovsky, 2020. "Social and Monopoly Optimization in Observable Queues," Operations Research, INFORMS, vol. 68(4), pages 1178-1198, July.

    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. Refael Hassin & Ran I. Snitkovsky, 2020. "Social and Monopoly Optimization in Observable Queues," Operations Research, INFORMS, vol. 68(4), pages 1178-1198, July.
    2. Refael Hassin, 2022. "Profit maximization and cost balancing in queueing systems," Queueing Systems: Theory and Applications, Springer, vol. 100(3), pages 429-431, April.
    3. Platz, Trine Tornøe & Østerdal, Lars Peter, 2017. "The curse of the first-in–first-out queue discipline," Games and Economic Behavior, Elsevier, vol. 104(C), pages 165-176.
    4. Cripps, Martin W. & Thomas, Caroline D., 2019. "Strategic experimentation in queues," Theoretical Economics, Econometric Society, vol. 14(2), May.
    5. Moshe Haviv & Binyamin Oz, 2014. "Self-regulation of a queue via random priorities," Discussion Paper Series dp674, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
    6. A C Brooms & E J Collins, 2013. "Stochastic Order Results and Equilibrium Joining Rules for the Bernoulli Feedback Queue," Birkbeck Working Papers in Economics and Finance 1305, Birkbeck, Department of Economics, Mathematics & Statistics.
    7. Maria Arbatskaya & Kaushik Mukhopadhaya & Eric Rasmusen, 2001. "The Parking Lot Problem," CIRJE F-Series CIRJE-F-119, CIRJE, Faculty of Economics, University of Tokyo.
      • Maria Arbatskaya & Kaushik Mukhopadhaya & Eric Rasmusen, 2007. "The Parking Lot Problem," Working Papers 2007-04, Indiana University, Kelley School of Business, Department of Business Economics and Public Policy.
    8. Wang, Jinting & Zhang, Feng, 2013. "Strategic joining in M/M/1 retrial queues," European Journal of Operational Research, Elsevier, vol. 230(1), pages 76-87.
    9. Radhakrishnan, Suresh & Balachandran, Kashi R., 1995. "Stochastic choice hazard and incentives in a common service facility," European Journal of Operational Research, Elsevier, vol. 81(2), pages 324-335, March.
    10. Hanukov, Gabi & Avinadav, Tal & Chernonog, Tatyana & Yechiali, Uri, 2020. "A service system with perishable products where customers are either fastidious or strategic," International Journal of Production Economics, Elsevier, vol. 228(C).
    11. Tingliang Huang & Gad Allon & Achal Bassamboo, 2013. "Bounded Rationality in Service Systems," Manufacturing & Service Operations Management, INFORMS, vol. 15(2), pages 263-279, May.
    12. de Palma, André & Fosgerau, Mogens, 2013. "Random queues and risk averse users," European Journal of Operational Research, Elsevier, vol. 230(2), pages 313-320.
    13. Moshe Haviv & Liron Ravner, 2021. "A survey of queueing systems with strategic timing of arrivals," Queueing Systems: Theory and Applications, Springer, vol. 99(1), pages 163-198, October.
    14. Philipp Afèche & Haim Mendelson, 2004. "Pricing and Priority Auctions in Queueing Systems with a Generalized Delay Cost Structure," Management Science, INFORMS, vol. 50(7), pages 869-882, July.
    15. Knight, Vincent A. & Harper, Paul R., 2013. "Selfish routing in public services," European Journal of Operational Research, Elsevier, vol. 230(1), pages 122-132.
    16. Nur Sunar & Yichen Tu & Serhan Ziya, 2021. "Pooled vs. Dedicated Queues when Customers Are Delay-Sensitive," Management Science, INFORMS, vol. 67(6), pages 3785-3802, June.
    17. Baris Ata & Peter W. Glynn & Xiaoshan Peng, 2017. "An equilibrium analysis of a discrete-time Markovian queue with endogenous abandonments," Queueing Systems: Theory and Applications, Springer, vol. 86(1), pages 141-212, June.
    18. Ying Chen & John J. Hasenbein, 2020. "Knowledge, congestion, and economics: Parameter uncertainty in Naor’s model," Queueing Systems: Theory and Applications, Springer, vol. 96(1), pages 83-99, October.
    19. Yasushi Masuda & Akira Tsuji, 2019. "Congestion Control for a System with Parallel Stations and Homogeneous Customers Using Priority Passes," Networks and Spatial Economics, Springer, vol. 19(1), pages 293-318, March.
    20. Bradford, Richard M., 1996. "Pricing, routing, and incentive compatibility in multiserver queues," European Journal of Operational Research, Elsevier, vol. 89(2), pages 226-236, March.

    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:inm:ormnsc:v:62:y:2016:i:3:p:899-903. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.