技术说明-实时订单接收的近最优算法:在急性后医疗保健服务中的应用

Oper. Res. Pub Date : 2022-05-17 DOI:10.1287/opre.2022.2278
Zihao Qu, Milind Dawande, G. Janakiraman
{"title":"技术说明-实时订单接收的近最优算法:在急性后医疗保健服务中的应用","authors":"Zihao Qu, Milind Dawande, G. Janakiraman","doi":"10.1287/opre.2022.2278","DOIUrl":null,"url":null,"abstract":"A Near-Optimal Patient Admission Policy in Postacute Care Motivated by applications in the postacute healthcare industry, in “Technical Note—A Near-Optimal Algorithm for Real-Time Order Acceptance: An Application in Postacute Healthcare Services,” Qu, Dawande, and Janakiraman study an infinite-horizon, stochastic optimization problem with a set of long-term capacity investment decisions and a sequence of real-time order acceptance/rejection decisions. To maximize the long-run average expected profit per period, the firm accepts/rejects stochastically arriving referrals in real time. Referrals differ in the revenue they offer to the firm, the resource requirements and the frequency of usage of the resources, and the stochastic duration of the episode. The authors develop a simple policy, derive a worst case guarantee on its optimality gap, and show that the policy is asymptotically optimal. They also illustrate an impressive numerical performance of the policy using public healthcare data.","PeriodicalId":19546,"journal":{"name":"Oper. Res.","volume":"67 1","pages":"2213-2225"},"PeriodicalIF":0.0000,"publicationDate":"2022-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Technical Note - A Near-Optimal Algorithm for Real-Time Order Acceptance: An Application in Postacute Healthcare Services\",\"authors\":\"Zihao Qu, Milind Dawande, G. Janakiraman\",\"doi\":\"10.1287/opre.2022.2278\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A Near-Optimal Patient Admission Policy in Postacute Care Motivated by applications in the postacute healthcare industry, in “Technical Note—A Near-Optimal Algorithm for Real-Time Order Acceptance: An Application in Postacute Healthcare Services,” Qu, Dawande, and Janakiraman study an infinite-horizon, stochastic optimization problem with a set of long-term capacity investment decisions and a sequence of real-time order acceptance/rejection decisions. To maximize the long-run average expected profit per period, the firm accepts/rejects stochastically arriving referrals in real time. Referrals differ in the revenue they offer to the firm, the resource requirements and the frequency of usage of the resources, and the stochastic duration of the episode. The authors develop a simple policy, derive a worst case guarantee on its optimality gap, and show that the policy is asymptotically optimal. They also illustrate an impressive numerical performance of the policy using public healthcare data.\",\"PeriodicalId\":19546,\"journal\":{\"name\":\"Oper. Res.\",\"volume\":\"67 1\",\"pages\":\"2213-2225\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-05-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Oper. Res.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1287/opre.2022.2278\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Oper. Res.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1287/opre.2022.2278","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在“技术笔记-实时订单接受的近最优算法:在后急性医疗保健服务中的应用”中,Qu、Dawande和Janakiraman研究了一个具有一组长期能力投资决策和一系列实时订单接受/拒绝决策的无限视界随机优化问题。为了使每个时期的长期平均预期利润最大化,公司实时接受/拒绝随机到来的推荐。推荐给公司带来的收入不同,资源需求和资源使用频率不同,事件的随机持续时间也不同。提出了一个简单的策略,给出了其最优性差的最坏情况保证,并证明了该策略是渐近最优的。它们还利用公共医疗保健数据说明了该政策令人印象深刻的数字表现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Technical Note - A Near-Optimal Algorithm for Real-Time Order Acceptance: An Application in Postacute Healthcare Services
A Near-Optimal Patient Admission Policy in Postacute Care Motivated by applications in the postacute healthcare industry, in “Technical Note—A Near-Optimal Algorithm for Real-Time Order Acceptance: An Application in Postacute Healthcare Services,” Qu, Dawande, and Janakiraman study an infinite-horizon, stochastic optimization problem with a set of long-term capacity investment decisions and a sequence of real-time order acceptance/rejection decisions. To maximize the long-run average expected profit per period, the firm accepts/rejects stochastically arriving referrals in real time. Referrals differ in the revenue they offer to the firm, the resource requirements and the frequency of usage of the resources, and the stochastic duration of the episode. The authors develop a simple policy, derive a worst case guarantee on its optimality gap, and show that the policy is asymptotically optimal. They also illustrate an impressive numerical performance of the policy using public healthcare data.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A web-based multi-criteria decision support system for benchmarking marketing decisions alternatives Integrated optimization of wagon flow routing and train formation plan Two-machine decentralized flow shop scheduling problem with inter-factory batch delivery system A simplified swarm optimization algorithm to minimize makespan on non-identical parallel machines with unequal job release times under non-renewable resource constraints Meta-frontier: literature review and toolkit
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1