One hyper‐heuristic approach to two timetabling problems in health care

We present one general high‐level hyper‐heuristic approach for addressing two timetabling problems in the health care domain: the patient admission scheduling problem and the nurse rostering problem. The complex combinatorial problem of patient admission scheduling has only recently been introduced to the research community. In addition to the instance that was introduced on this occasion, we present a new set of benchmark instances. Nurse rostering, on the other hand, is a well studied operations research problem in health care. Over the last years, a number of problem definitions and their corresponding benchmark instances have been introduced. Recently, a new nurse rostering problem description and datasets were introduced during the first Nurse Rostering Competition. In the present paper, we focus on this nurse rostering problem description. The main contribution of the paper constitutes the introduction of a general hyper‐heuristic approach, which is suitable for addressing two rather different timetabling problems in health care. It is applicable without much effort, provided a set of low‐level heuristics is available for each problem. We consider the instances of both health care problems for testing the general applicability of the hyper‐heuristic approach. Also, improvements to the previous best results for the patient admission scheduling problem are presented. Solutions to the new nurse rostering instances are presented and compared with results obtained by an integer linear programming approach.