Scholarlink

The Nurse Rostering Problem is a very hard staff scheduling problem that aims to assign a set of nurses to shifts within a scheduling horizon. Nurses are characterized by one or more skills, are hired through a contract that regulates their work, and can express preferences regarding days off or work shifts. A preferred coverage is defined for each shift in the planning horizon, which represents the number of nurses the hospital would like to have. We address here the version of the problem proposed in 2014 by Curtois through a revised version of FiNeMath matheuristic. Preliminary results showed that the heuristic can determine high-quality solutions in a very short time for medium and small instances.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

An Effective Matheuristic Approach to Solve Nurse Rostering Problem

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Cristian Belfiore

摘要

The Nurse Rostering Problem is a very hard staff scheduling problem that aims to assign a set of nurses to shifts within a scheduling horizon. Nurses are characterized by one or more skills, are hired through a contract that regulates their work, and can express preferences regarding days off or work shifts. A preferred coverage is defined for each shift in the planning horizon, which represents the number of nurses the hospital would like to have. We address here the version of the problem proposed in 2014 by Curtois through a revised version of FiNeMath matheuristic. Preliminary results showed that the heuristic can determine high-quality solutions in a very short time for medium and small instances.