Capacity Allocation and Scheduling in Two-Stage Service Systems with Multiclass Customers

Z. Zhong, Ping Cao, Junfei Huang, Sean X. Zhou
{"title":"Capacity Allocation and Scheduling in Two-Stage Service Systems with Multiclass Customers","authors":"Z. Zhong, Ping Cao, Junfei Huang, Sean X. Zhou","doi":"10.1287/msom.2023.0266","DOIUrl":null,"url":null,"abstract":"Problem definition: This paper considers a tandem queueing system in which stage 1 has one station serving multiple classes of arriving customers with different service requirements and related delay costs, and stage 2 has multiple parallel stations, with each station providing one type of service. Each station has many statistically identical servers. The objective is to design a joint capacity allocation between stages/stations and scheduling rule of different classes of customers to minimize the system’s long-run average cost. Methodology/results: Using fluid approximation, we convert the stochastic problem into a fluid optimization problem and develop a solution procedure. Based on the solution to the fluid optimization problem, we propose a simple and easy-to-implement capacity allocation and scheduling policy and establish its asymptotic optimality for the stochastic system. The policy has an explicit index-based scheduling rule that is independent of the arrival rates, and resource allocation is determined by the priority orders established between the classes and stations. We conduct numerical experiments to validate the accuracy of the fluid approximation and demonstrate the effectiveness of our proposed policy. Managerial implications: Tandem queueing systems are ubiquitous. Our results provide useful guidelines for the allocation of limited resources and the scheduling of customer service in those systems. Our proposed policy can improve the system’s operational efficiency and customers’ service quality. Funding: Z. Zhong’s research is partially supported by the Fundamental Research Funds for the Central Universities [Grant 2023ZYGXZR074] and the Hunan Provincial Natural Science Foundation of China [Grant 2022JJ40109]. P. Cao’s research is partially supported by the National Natural Science Foundation of China [Grant 72122019]. J. Huang’s research is partially supported by the Hong Kong Research Grants Council General Research Fund [CUHK-14501621] and the National Natural Science Foundation of China [Grant 72222023]. S. X. Zhou’s research is partially supported by the Hong Kong Research Grants Council General Research Fund [CUHK-14500921], the National Natural Science Foundation of China [Grant 72394395], and the Asian Institute of Supply Chains and Logistics. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2023.0266 .","PeriodicalId":119284,"journal":{"name":"Manufacturing & Service Operations Management","volume":"5 9","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Manufacturing & Service Operations Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1287/msom.2023.0266","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Problem definition: This paper considers a tandem queueing system in which stage 1 has one station serving multiple classes of arriving customers with different service requirements and related delay costs, and stage 2 has multiple parallel stations, with each station providing one type of service. Each station has many statistically identical servers. The objective is to design a joint capacity allocation between stages/stations and scheduling rule of different classes of customers to minimize the system’s long-run average cost. Methodology/results: Using fluid approximation, we convert the stochastic problem into a fluid optimization problem and develop a solution procedure. Based on the solution to the fluid optimization problem, we propose a simple and easy-to-implement capacity allocation and scheduling policy and establish its asymptotic optimality for the stochastic system. The policy has an explicit index-based scheduling rule that is independent of the arrival rates, and resource allocation is determined by the priority orders established between the classes and stations. We conduct numerical experiments to validate the accuracy of the fluid approximation and demonstrate the effectiveness of our proposed policy. Managerial implications: Tandem queueing systems are ubiquitous. Our results provide useful guidelines for the allocation of limited resources and the scheduling of customer service in those systems. Our proposed policy can improve the system’s operational efficiency and customers’ service quality. Funding: Z. Zhong’s research is partially supported by the Fundamental Research Funds for the Central Universities [Grant 2023ZYGXZR074] and the Hunan Provincial Natural Science Foundation of China [Grant 2022JJ40109]. P. Cao’s research is partially supported by the National Natural Science Foundation of China [Grant 72122019]. J. Huang’s research is partially supported by the Hong Kong Research Grants Council General Research Fund [CUHK-14501621] and the National Natural Science Foundation of China [Grant 72222023]. S. X. Zhou’s research is partially supported by the Hong Kong Research Grants Council General Research Fund [CUHK-14500921], the National Natural Science Foundation of China [Grant 72394395], and the Asian Institute of Supply Chains and Logistics. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2023.0266 .
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
多类别客户两阶段服务系统中的容量分配与调度
问题定义:本文考虑的是一个串联排队系统,其中第 1 阶段有一个站点,为具有不同服务要求和相关延迟成本的多类到达客户提供服务;第 2 阶段有多个并行站点,每个站点提供一种服务。每个站点都有许多统计上相同的服务器。目标是设计阶段/站点之间的联合容量分配和不同类别客户的调度规则,使系统的长期平均成本最小化。方法/结果:利用流体近似法,我们将随机问题转化为流体优化问题,并开发了一个求解程序。在流体优化问题求解的基础上,我们提出了一种简单易行的容量分配和调度策略,并确定了其在随机系统中的渐进最优性。该策略有一个与到达率无关的基于指数的显式调度规则,资源分配由等级和站点之间建立的优先顺序决定。我们通过数值实验验证了流体近似的准确性,并证明了我们提出的政策的有效性。管理意义:串联排队系统无处不在。我们的研究结果为这些系统中有限资源的分配和客户服务的安排提供了有用的指导。我们提出的策略可以提高系统的运行效率和客户服务质量。资助:钟泽的研究得到中央高校基本科研业务费[2023ZYGXZR074]和湖南省自然科学基金[2022JJ40109]的部分资助。曹鹏的研究得到国家自然科学基金[72122019]的部分资助。黄杰的研究得到香港研究资助局一般研究基金[CUHK-14501621]和国家自然科学基金[72222023]的部分资助。S. X. Zhou 的研究得到香港研究资助局一般研究基金[CUHK-14500921]、国家自然科学基金[72394395]和亚洲供应链与物流研究所的部分资助。补充材料:网上附录见 https://doi.org/10.1287/msom.2023.0266 。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Physician Adoption of AI Assistant Disclosing Delivery Performance Information When Consumers Are Sensitive to Promised Delivery Time, Delivery Reliability, and Price Loyalty Currency and Mental Accounting: Do Consumers Treat Points Like Money? Dealership or Marketplace with Fulfillment Services: A Dynamic Comparison Introduction: Frontiers in Operations
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1