IDEAS home Printed from https://ideas.repec.org/a/spr/queues/v108y2024i1d10.1007_s11134-024-09920-3.html
   My bibliography  Save this article

Capacity allocation in a two-channel service system from a social planner’s perspective

Author

Listed:
  • Feray Tunçalp

    (UCL School of Management)

  • Lerzan Örmeci

    (Koç University)

  • Evrim D. Güneş

    (Koç University)

Abstract

This paper considers a capacity allocation problem in a two-channel service system. Customers can receive service from either a single-server queueing system, which serves the customers waiting in line one by one, or a clearing service system, which serves a fixed number of customers simultaneously according to its capacity. Customers who join the queueing system should wait till they receive service. In contrast, customers who join the clearing system face the risk of service denial when there are more customers than the clearing system’s capacity. The social planner aims to minimize the total expected cost of all customers by determining the capacities and the arrival rates for the two channels. There are two settings: an unobservable setting where only the expected waiting time information is available and an observable setting where real-time information about the exact workload of the queueing system is known. We also consider the same system under the same settings with strategic customers who choose one of the two channels strategically to minimize their costs. The planner still has the same objective but can now decide only on the capacity allocation. Comparing the performance of the resulting systems allows us to understand the value of coordination and information. Extensions of these systems that serve two customer types are also explored.

Suggested Citation

  • Feray Tunçalp & Lerzan Örmeci & Evrim D. Güneş, 2024. "Capacity allocation in a two-channel service system from a social planner’s perspective," Queueing Systems: Theory and Applications, Springer, vol. 108(1), pages 185-213, October.
  • Handle: RePEc:spr:queues:v:108:y:2024:i:1:d:10.1007_s11134-024-09920-3
    DOI: 10.1007/s11134-024-09920-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11134-024-09920-3
    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-024-09920-3?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.

    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:108:y:2024:i:1:d:10.1007_s11134-024-09920-3. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.