【24h】

Relaxation of Coverage Constraints in Hospital Personnel Rostering

机译:放宽医护人员名册中的承保限制

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

摘要

Hospital personnel scheduling deals with a large number of constraints of a different nature, some of which need to be satisfied at all costs. It is, for example, unacceptable not to fully support patient care needs and therefore a sufficient number of skilled personnel has to be scheduled at any time. In addition to personnel coverage constraints, nurse rostering problems deal with time-related constraints arranging work load, free time, and personal requests for the staff. Real-world nurse rostering problems are usually over-constrained but schedulers in hospitals manage to produce solutions anyway. In practice, coverage constraints, which are generally denned as hard constraints, are often relaxed by the head nurse or personnel manager. The work presented in this paper builds upon a previously developed nurse rostering system that is used in several Belgian hospitals. In order to deal with widely varying problems and objectives, all the data in the model are modifiable by the users. We introduce a set of specific algorithms for handling and even relaxing coverage constraints, some of which were not supposed to be violated in the original model. The motivation is that such practices are common in real scheduling environments. Relaxations enable the generation of better-quality schedules without enlarging the search space or the computation time.
机译:医院人员调度处理大量不同性质的约束,其中一些需要不惜一切代价得到满足。例如,不能完全满足患者的护理需求是不可接受的,因此必须随时安排足够数量的技术人员。除人员覆盖范围限制外,护士花名册问题还与时间相关的约束,包括工作量,空闲时间和对员工的个人要求。现实世界中的护士名册问题通常受到过度约束,但是医院的调度员仍然设法产生解决方案。实际上,主管护士或人事经理通常会放宽通常被定义为硬性​​约束的覆盖约束。本文介绍的工作基于先前开发的护士排班系统,该系统已在比利时的多家医院中使用。为了处理各种各样的问题和目标,用户可以修改模型中的所有数据。我们介绍了一组用于处理甚至放松覆盖范围约束的特定算法,其中某些在原始模型中不应被违反。其动机是这种做法在实际的调度环境中很常见。放宽可以生成质量更高的计划,而不会增加搜索空间或计算时间。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号