Publication:
Capacity allocation in a two-channel service system from a social planner's perspective

dc.contributor.coauthorTuncalp, Feray
dc.contributor.departmentDepartment of Industrial Engineering
dc.contributor.departmentDepartment of Business Administration
dc.contributor.kuauthorGüneş, Evrim Didem
dc.contributor.kuauthorÖrmeci, Lerzan
dc.contributor.schoolcollegeinstituteCollege of Engineering
dc.contributor.schoolcollegeinstituteCollege of Administrative Sciences and Economics
dc.date.accessioned2024-12-29T09:39:34Z
dc.date.issued2024
dc.description.abstractThis 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.
dc.description.indexedbyWOS
dc.description.indexedbyScopus
dc.description.issue02/01/24
dc.description.publisherscopeInternational
dc.description.sponsoredbyTubitakEuN/A
dc.description.sponsorshipThis research has been supported by a grant (AXA Award) from the AXA Research Fund.
dc.description.volume108
dc.identifier.doi10.1007/s11134-024-09920-3
dc.identifier.eissn1572-9443
dc.identifier.issn0257-0130
dc.identifier.quartileQ4
dc.identifier.scopus2-s2.0-85200316728
dc.identifier.urihttps://doi.org/10.1007/s11134-024-09920-3
dc.identifier.urihttps://hdl.handle.net/20.500.14288/23045
dc.identifier.wos1282993700002
dc.keywordsCapacity allocation in service systems
dc.keywordsSocial behavior
dc.keywordsQueueing and game theory
dc.keywordsClearing service systems
dc.language.isoeng
dc.publisherSpringer
dc.relation.ispartofQueueing Systems
dc.subjectOperations research and management science
dc.titleCapacity allocation in a two-channel service system from a social planner's perspective
dc.typeJournal Article
dspace.entity.typePublication
local.contributor.kuauthorÖrmeci, Lerzan
local.contributor.kuauthorGüneş, Evrim Didem
local.publication.orgunit1College of Engineering
local.publication.orgunit2Department of Industrial Engineering;Department of Business Administration
relation.isOrgUnitOfPublicationd6d00f52-d22d-4653-99e7-863efcd47b4a
relation.isOrgUnitOfPublicationca286af4-45fd-463c-a264-5b47d5caf520
relation.isOrgUnitOfPublication.latestForDiscoveryd6d00f52-d22d-4653-99e7-863efcd47b4a
relation.isParentOrgUnitOfPublication8e756b23-2d4a-4ce8-b1b3-62c794a8c164
relation.isParentOrgUnitOfPublication972aa199-81e2-499f-908e-6fa3deca434a
relation.isParentOrgUnitOfPublication.latestForDiscovery8e756b23-2d4a-4ce8-b1b3-62c794a8c164

Files