启发式
计算机科学
运筹学
时间范围
集合(抽象数据类型)
服务(商务)
业务
资源(消歧)
竞争分析
数学优化
营销
计算机网络
上下界
数学分析
工程类
操作系统
程序设计语言
数学
作者
Clifford Stein,Van-Anh Truong,Xinshang Wang
出处
期刊:Management Science
[Institute for Operations Research and the Management Sciences]
日期:2020-07-01
卷期号:66 (7): 2929-2950
被引量:28
标识
DOI:10.1287/mnsc.2019.3364
摘要
We study a fundamental model of resource allocation in which a finite number of resources must be assigned in an online manner to a heterogeneous stream of customers. The customers arrive randomly over time according to known stochastic processes. Each customer requires a specific amount of capacity and has a specific preference for each of the resources with some resources being feasible for the customer and some not. The system must find a feasible assignment of each customer to a resource or must reject the customer. The aim is to maximize the total expected capacity utilization of the resources over the horizon. This model has application in services, freight transportation, and online advertising. We present online algorithms with bounded competitive ratios relative to an optimal off-line algorithm that knows all stochastic information. Our algorithms perform extremely well compared with common heuristics as demonstrated on a real data set from a large hospital system in New York City. This paper was accepted by Yinyu Ye, optimization.
科研通智能强力驱动
Strongly Powered by AbleSci AI