...
首页> 外文期刊>Manufacturing and Service Operations Management >Online Advance Scheduling with Overtime:A Primal-Dual Approach
【24h】

Online Advance Scheduling with Overtime:A Primal-Dual Approach

机译:使用加班时的在线提前调度:一种原始方法

获取原文
获取原文并翻译 | 示例
           

摘要

Problem definition: We study a fundamental online resource allocation problem in service operations in which a heterogeneous stream of arrivals that varies in service times and rewards makes service requests from a finite number of servers/providers. This is an online adversarial setting in which nothing more is known about the arrival process of customers. Each server has a finite regular capacity but can be expanded at the expense of overtime cost. Upon arrival of each customer, the system chooses both a server and a time for service over a scheduling horizon subject to capacity constraints. The system seeks easy-to-implement online policies that admit a competitive ratio (CR), guaranteeing the worst-case relative performance. Academic/practical relevance: On the academic side, we propose online algorithms with theoretical CRs for the problem described above. On the practical side, we investigate the real-world applicability of our methods and models on appointment-scheduling data from a partner health system. Methodology: We develop new online primal-dual approaches for making not only a server-date allocation decision for each arriving customer, but also an overtime decision for each server on each day within a horizon. We also derive a competitive analysis to prove a theoretical performance guarantee. Results: Our online policies are (i) robust to future information, (ii) easy-to-implement and extremely efficient to compute, and (iii) admitting a theoretical CR. Comparing our online policy with the optimal offline policy, we obtain a CR that guarantees the worst-case performance of our online policy. Managerial implications: We evaluate the performance of our online algorithms by using real appointment scheduling data from a partner health system. Our results show that the proposed online policies perform much better than their theoretical CR, and outperform the pervasive First-Come-First-Served (FCFS) and nested threshold policies (NTPO) by a large margin.
机译:问题定义:我们研究了服务运营中的基本在线资源分配问题,其中服务时间和奖励在服务时间和奖励中变化的异构流,从而从有限数量的服务器/提供者提供服务请求。这是一个在线对抗性环境,其中没有任何关于客户的到达过程所知的东西。每个服务器都有一个有限的常规容量,但可以以费用为代价而扩展。到达每个客户时,系统选择服务器以及通过调度地平线进行服务,以受容量约束。该系统寻求易于实施的在线政策,承认竞争比率(CR),保证最坏情况的相对性能。学术/实际相关性:在学术方面,我们提出了对上述问题的理论CRS的在线算法。在实践方面,我们研究了我们对伙伴健康系统预约调度数据的方法和模型的真实适用性。方法:我们开发新的在线原始方法,不仅可以为每个到达客户提供服务器日期分配决策,还可以在地平线内每天的每台服务器的加班决定。我们还导出了竞争性分析,以证明理论性能保证。结果:我们的在线政策(i)强大到未来的信息,(ii)易于实施,非常有效地计算,(iii)承认理论CR。将我们的在线策略与最佳离线策略进行比较,我们获得了一个保证我们在线策略的最坏情况表现的CR。管理含义:我们通过使用合作伙伴健康系统的实际预约调度数据来评估我们的在线算法的性能。我们的研究结果表明,建议的在线政策比理论CR更好地表现出更好,并且优于普遍的第一服务(FCF)和嵌套的阈值政策(NTPO)大幅度。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号