HOROPLAN: computer-assisted nurse scheduling using constraint-based programming.

S J Darmoni, A Fajner, N Mahé, A Leforestier, M Vondracek, O Stelian, M Baldenweck
{"title":"HOROPLAN: computer-assisted nurse scheduling using constraint-based programming.","authors":"S J Darmoni,&nbsp;A Fajner,&nbsp;N Mahé,&nbsp;A Leforestier,&nbsp;M Vondracek,&nbsp;O Stelian,&nbsp;M Baldenweck","doi":"","DOIUrl":null,"url":null,"abstract":"<p><p>Nurse scheduling is a difficult and time consuming task. The schedule has to determine the day to day shift assignments of each nurse for a specified period of time in a way that satisfies the given requirements as much as possible, taking into account the wishes of nurses as closely as possible. This paper presents a constraint-based, artificial intelligence approach by describing a prototype implementation developed with the Charme language and the first results of its use in the Rouen University Hospital. Horoplan implements a non-cyclical constraint-based scheduling, using some heuristics. Four levels of constraints were defined to give a maximum of flexibility: French level (e.g. number of worked hours in a year), hospital level (e.g. specific day-off), department level (e.g. specific shift) and care unit level (e.g. specific pattern for week-ends). Some constraints must always be verified and can not be overruled and some constraints can be overruled at a certain cost. Rescheduling is possible at any time specially in case of an unscheduled absence.</p>","PeriodicalId":77231,"journal":{"name":"Journal of the Society for Health Systems","volume":"5 1","pages":"41-54"},"PeriodicalIF":0.0000,"publicationDate":"1995-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of the Society for Health Systems","FirstCategoryId":"1085","ListUrlMain":"","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Nurse scheduling is a difficult and time consuming task. The schedule has to determine the day to day shift assignments of each nurse for a specified period of time in a way that satisfies the given requirements as much as possible, taking into account the wishes of nurses as closely as possible. This paper presents a constraint-based, artificial intelligence approach by describing a prototype implementation developed with the Charme language and the first results of its use in the Rouen University Hospital. Horoplan implements a non-cyclical constraint-based scheduling, using some heuristics. Four levels of constraints were defined to give a maximum of flexibility: French level (e.g. number of worked hours in a year), hospital level (e.g. specific day-off), department level (e.g. specific shift) and care unit level (e.g. specific pattern for week-ends). Some constraints must always be verified and can not be overruled and some constraints can be overruled at a certain cost. Rescheduling is possible at any time specially in case of an unscheduled absence.

HOROPLAN:使用基于约束的编程的计算机辅助护士调度。
护士日程安排是一项困难且耗时的任务。日程安排必须以尽可能满足给定要求的方式确定每个护士在指定时间段内的日常轮班任务,并尽可能密切地考虑护士的意愿。本文通过描述用Charme语言开发的原型实现及其在鲁昂大学医院使用的第一个结果,提出了一种基于约束的人工智能方法。Horoplan使用一些启发式方法实现了一种非周期性的基于约束的调度。为实现最大限度的灵活性,确定了四个级别的限制:法国级别(例如,一年的工作小时数)、医院级别(例如,特定的休息日)、部门级别(例如,特定的轮班)和护理单位级别(例如,周末的特定模式)。有些约束必须始终得到验证,不能被推翻;有些约束可以被推翻,但要付出一定的代价。可以随时重新安排,特别是在计划外缺席的情况下。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信