Nurse Rostering with Soft Constraints Evidence from Chilean Mid-size Health Care Centers

被引:0
|
作者
Soto, Ricardo [1 ,2 ]
Crawford, Broderick [1 ,3 ]
Bertrand, Rodrigo [1 ]
Monfroy, Eric [4 ]
机构
[1] Pontificia Univ Catolica Valparaiso, Valparaiso, Chile
[2] Univ Autonoma Chile, Santiago, Chile
[3] Univ Finis Terrae, Santiago, Chile
[4] Univ Nantes, CNRS, LINA, Nantes, France
关键词
Rostering; Constraint Programming; Heuristic Search; NEIGHBORHOOD SEARCH; TABU SEARCH; ALGORITHM;
D O I
10.5220/0004417404300435
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Nurse rostering deals with the shifts arrangements of nursing staff in the daily operation of health care centers. The design of suitable rosters for nurses is known to be particularly complex due to the number of interrelated requirements that must be considered. The literature reports a wide list of works devoted to solve such a problem. The techniques used range from classic methods such as linear programming to more modern incomplete methods such as evolutionary computing. However, most works are centered on the performance of techniques for solving well-known instances of nurse rostering. In this paper, we focus on a real case study of nurse rostering. The solution is devoted to a set of mid-size Chilean hospitals that use a very uncommon shift pattern due to proper country legal regulations. We present a new model involving hard and soft constraints that can be applied generically to any chilean health care center.
引用
收藏
页码:430 / 435
页数:6
相关论文
共 31 条