计算机科学
推论
排队论
排队
数学优化
统计推断
稳健优化
大容量队列
分层排队网络
钥匙(锁)
运筹学
人工智能
数学
统计
计算机网络
计算机安全
作者
Chaithanya Bandi,Eojin Han,Alexej Proskynitopoulos
出处
期刊:Operations Research
[Institute for Operations Research and the Management Sciences]
日期:2023-12-14
卷期号:72 (2): 459-480
标识
DOI:10.1287/opre.2022.0091
摘要
Modeling and decision making for queueing systems have been one of fundamental topics in operations research. For these problems, uncertainty models are established by estimation of key parameters such as expected interarrival and service times. In practice, however, their distributions are unknown, and decision makers are only given historical records of waiting times, which contain relevant but indirect information on the uncertainties. Their complex temporal dependence on the queueing dynamics and the absence of distributional information on the model primitives render estimation of queueing systems remarkably challenging. In the paper “Robust Queue Inference from Waiting Times” by Chaithanya Bandi, Eojin Han, and Alexej Proskynitopoulos, a new inference framework based on robust optimization is proposed to estimate unknown service times from waiting time observations. This new framework allows data-driven, distribution-free estimation on unknown model primitives by solving tractable optimization problems.
科研通智能强力驱动
Strongly Powered by AbleSci AI