数学优化
计算机科学
整数规划
线性规划
调度(生产过程)
随机规划
稳健优化
数学
作者
Ruiwei Jiang,Siqian Shen,Yiling Zhang
出处
期刊:Operations Research
[Institute for Operations Research and the Management Sciences]
日期:2017-10-09
卷期号:65 (6): 1638-1656
被引量:113
标识
DOI:10.1287/opre.2017.1656
摘要
We consider a single-server scheduling problem given a fixed sequence of appointment arrivals with random no-shows and service durations. The probability distribution of the uncertain parameters is assumed to be ambiguous, and only the support and first moments are known. We formulate a class of distributionally robust (DR) optimization models that incorporate the worst-case expectation/conditional value-at-risk penalty cost of appointment waiting, server idleness, and overtime into the objective or constraints. Our models flexibly adapt to different prior beliefs of no-show uncertainty. We obtain exact mixed-integer nonlinear programming reformulations and derive valid inequalities to strengthen the reformulations that are solved by decomposition algorithms. In particular, we derive convex hulls for special cases of no-show beliefs, yielding polynomial-sized linear programming models for the least and the most conservative supports of no-shows. We test various instances to demonstrate the computational efficacy of our approaches and to compare the results of various DR models given perfect or ambiguous distributional information. The e-companion is available at https://doi.org/10.1287/opre.2017.1656 .
科研通智能强力驱动
Strongly Powered by AbleSci AI