Continuity of care in home health care scheduling: a rolling horizon approach

IF 1.4 4区 工程技术 Q4 ENGINEERING, MANUFACTURING Journal of Scheduling Pub Date : 2024-01-27 DOI:10.1007/s10951-023-00796-4
Şeyma Güven-Koçak, Aliza Heching, Pınar Keskinocak, Alejandro Toriello
{"title":"Continuity of care in home health care scheduling: a rolling horizon approach","authors":"Şeyma Güven-Koçak, Aliza Heching, Pınar Keskinocak, Alejandro Toriello","doi":"10.1007/s10951-023-00796-4","DOIUrl":null,"url":null,"abstract":"<p>This work addresses a home health care scheduling problem faced by home care agencies. In home health care scheduling, there is a desire to retain consistency with respect to the home health aide servicing each patient; this consistency is referred to as <i>continuity of care</i>. To address this preference for continuity of care, we propose a rolling horizon approach to the scheduling problem and introduce the consistent home health care scheduling problem (Con-HHCSP). The goal is to be able to quantify and control the deviation of the new schedule suggested each day from the existing schedule in place, so that some of the existing assignments may be retained in the new schedule that is produced. We present two different methods to solve Con-HHCSP on a daily basis: an integer programming-based method with approximations and a variant of a petal heuristic. We discuss the performance and computational efficiency of these methods.</p>","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":null,"pages":null},"PeriodicalIF":1.4000,"publicationDate":"2024-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Scheduling","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1007/s10951-023-00796-4","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ENGINEERING, MANUFACTURING","Score":null,"Total":0}
引用次数: 0

Abstract

This work addresses a home health care scheduling problem faced by home care agencies. In home health care scheduling, there is a desire to retain consistency with respect to the home health aide servicing each patient; this consistency is referred to as continuity of care. To address this preference for continuity of care, we propose a rolling horizon approach to the scheduling problem and introduce the consistent home health care scheduling problem (Con-HHCSP). The goal is to be able to quantify and control the deviation of the new schedule suggested each day from the existing schedule in place, so that some of the existing assignments may be retained in the new schedule that is produced. We present two different methods to solve Con-HHCSP on a daily basis: an integer programming-based method with approximations and a variant of a petal heuristic. We discuss the performance and computational efficiency of these methods.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
居家医疗护理排班中的持续护理:滚动视野法
这项研究解决了家庭护理机构面临的一个家庭健康护理调度问题。在家庭医疗调度中,人们希望为每位患者提供服务的家庭医疗助理保持一致;这种一致性被称为护理的连续性。为了解决这种对护理连续性的偏好,我们对调度问题提出了一种滚动水平线方法,并引入了一致的家庭医疗调度问题(Con-HHCSP)。该问题的目标是量化和控制每天建议的新日程表与现有日程表的偏差,以便在生成的新日程表中保留部分现有任务。我们介绍了两种解决 Con-HHCSP 日常问题的不同方法:一种是基于整数编程的近似方法,另一种是花瓣启发式的变体。我们讨论了这些方法的性能和计算效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Journal of Scheduling
Journal of Scheduling 工程技术-工程:制造
CiteScore
3.80
自引率
10.00%
发文量
49
审稿时长
6-12 weeks
期刊介绍: The Journal of Scheduling provides a recognized global forum for the publication of all forms of scheduling research. First published in June 1998, Journal of Scheduling covers advances in scheduling research, such as the latest techniques, applications, theoretical issues and novel approaches to problems. The journal is of direct relevance to the areas of Computer Science, Discrete Mathematics, Operational Research, Engineering, Management, Artificial Intelligence, Construction, Distribution, Manufacturing, Transport, Aerospace and Retail and Service Industries. These disciplines face complex scheduling needs and all stand to gain from advances in scheduling technology and understanding.
期刊最新文献
Scheduling two interfering job sets on identical parallel machines with makespan and total completion time minimization A polynomial-time dynamic programming algorithm for an optimal picking problem in automated warehouses Scheduling periodic messages on a shared link without buffering Production scheduling decision-making technology for multiple CNC machining centers with constraints on serviceable time Sequential solutions in machine scheduling games
×
引用
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