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

Feray Tunçalp (), Lerzan Örmeci () and Evrim D. Güneş ()
Additional contact information
Feray Tunçalp: UCL School of Management
Lerzan Örmeci: Koç University
Evrim D. Güneş: Koç University

Queueing Systems: Theory and Applications, 2024, vol. 108, issue 1, No 5, 185-213

Abstract: 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.

Keywords: Capacity allocation in service systems; Social behavior; Queueing and game theory; Clearing service systems; 60K25; 90B22 (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s11134-024-09920-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:queues:v:108:y:2024:i:1:d:10.1007_s11134-024-09920-3

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/11134/

DOI: 10.1007/s11134-024-09920-3

Access Statistics for this article

Queueing Systems: Theory and Applications is currently edited by Sergey Foss

More articles in Queueing Systems: Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().