Optimal Advance Scheduling
Optimal Advance Scheduling
复制标题
DOI：
10.1287/mnsc.2014.2067
复制
发表时间：
2015-02
期刊：
影响因子：
--
通讯作者：
Van-Anh Truong
中科院分区：
文献类型：
--
作者：
Van-Anh Truong
为了管理需求和容量的每日变化，将患者动态分配到检查日是预约安排中一个长期开放的研究领域。特别是，动态分配提前任命被认为是特别具有挑战性的，因为它的维度很高。我们考虑了一个带有两个病人类别的动态提前调度的规范模型：一个紧急需求类别，必须在到达当天提供服务，以及一个常规需求类别，可以在将来的某个日期提供服务。患者接受提供的最早预约，不同提供者之间没有区别。我们得到了最优策略的一个令人惊讶的刻画，并给出了一个精确有效地计算该策略的算法。据我们所知，这些是对患者动态提前分配到检查日的第一个分析结果。我们引入了连续可精化的性质，这使得提前计划很容易计算，并且在这种情况下，系统对患者提前承诺没有成本。我们允许考虑多种类型的容量，并且需求和容量都是非平稳和随机的。
The dynamic assignment of patients to exam days in order to manage daily variations in demand and capacity is a long-standing open research area in appointment scheduling. In particular, the dynamic assignment of advance appointments has been considered to be especially challenging because of its high dimensionality. We consider a canonical model of dynamic advance scheduling with two patient classes: an urgent demand class, which must be served on the day of arrival, and a regular demand class, which can be served at a future date. Patients take the earliest appointments offered and do not differentiate among providers. We derive a surprising characterization of an optimal policy and an algorithm to compute the policy exactly and efficiently. These are, to our knowledge, the first analytical results for the dynamic advance assignment of patients to exam days. We introduce the property of successive refinability, which allows advance schedules to be easily computable and under which there is no cost to the system to making advance commitments to patients. We allow multiple types of capacity to be considered and both demand and capacity to be nonstationary and stochastic.