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

计算机科学 排队论 调度(生产过程) 运筹学 数学优化 服务质量 动态优先级调度 分布式计算 计算机网络 数学 工程类
作者
Zhiheng Zhong,Ping Cao,Junfei Huang,Sean X. Zhou
出处
期刊:Manufacturing & Service Operations Management [Institute for Operations Research and the Management Sciences]
卷期号:26 (5): 1842-1859 被引量:3
标识
DOI:10.1287/msom.2023.0266
摘要

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 .
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
1秒前
1秒前
斯文败类应助勤奋幻柏采纳,获得10
1秒前
爆米花应助小蓝采纳,获得30
1秒前
partiality发布了新的文献求助10
1秒前
2秒前
cp发布了新的文献求助10
3秒前
汉堡包应助恰恰恰采纳,获得10
3秒前
4秒前
隐形曼青应助YI采纳,获得30
5秒前
毛毛发布了新的文献求助10
5秒前
6秒前
lili完成签到 ,获得积分10
6秒前
6秒前
建哥发布了新的文献求助10
8秒前
wanci应助llz采纳,获得10
9秒前
慕青应助下雨天采纳,获得10
9秒前
传奇3应助Q清风慕竹采纳,获得10
10秒前
10秒前
蒸芋芋了发布了新的文献求助10
12秒前
果子发布了新的文献求助10
13秒前
WATQ完成签到,获得积分10
13秒前
14秒前
14秒前
Saber发布了新的文献求助10
16秒前
17秒前
谓风完成签到,获得积分10
17秒前
田様应助vidi采纳,获得10
18秒前
19秒前
时尚之桃完成签到 ,获得积分10
19秒前
zl发布了新的文献求助10
19秒前
火车飞机完成签到,获得积分10
20秒前
碧蓝天晴发布了新的文献求助10
20秒前
21秒前
21秒前
22秒前
YI发布了新的文献求助30
22秒前
CHEE完成签到,获得积分10
23秒前
汪酱酱完成签到 ,获得积分10
23秒前
胡思完成签到,获得积分10
23秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Modern Epidemiology, Fourth Edition 5000
Handbook of pharmaceutical excipients, Ninth edition 5000
Digital Twins of Advanced Materials Processing 2000
Weaponeering, Fourth Edition – Two Volume SET 2000
Polymorphism and polytypism in crystals 1000
Signals, Systems, and Signal Processing 610
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 纳米技术 有机化学 生物化学 化学工程 物理 计算机科学 复合材料 内科学 催化作用 物理化学 光电子学 电极 冶金 基因 遗传学
热门帖子
关注 科研通微信公众号,转发送积分 6022925
求助须知:如何正确求助?哪些是违规求助? 7645148
关于积分的说明 16170838
捐赠科研通 5171197
什么是DOI,文献DOI怎么找? 2767027
邀请新用户注册赠送积分活动 1750413
关于科研通互助平台的介绍 1637000