We make available a new set of benchmark problem instances for the admission planning problem. The problem formulation considers the allocation of day and operating room to a set of surgeries, as well as a specific time of surgery. Constraints include the feasibility of the chosen surgeon's individual schedule, as well as adherence to a "Master surgery schedule" for the operating rooms. The exact problem formulation, as well as computational results may be found in the paper A. Riise and E. K. Burke, Local search for the surgery admission planning problem, Journal of Heuristics.

 The benchmark data include three series of 10 benchmark problems each. Each series uses different relative weighting between the three objectives:

1. Patient waiting time
2. Children's waiting in the morning
3. Surgeon's overtime.

Each problem instance is defined by two files:

1.  Case.xml : The problem definition, including configuration parameters for the hospital in question.
2. InitialSolution.xml : The initial solution, which is the current admission plan as it exists on the morning of the day of planning. In this plan, all previously "locked-to-day" surgeries are scheduled, while all un-locked surgeries are given as "unserved".

In addition, for each case a best known solution is given, in the file BestSolution.xml.

For more details about the problem, see the above mentioned paper.

Download: Admission-Planning-Benchmarks-SINTEF_1

When referring to these test bench data in publications, please use the following reference:

A. Riise and E. K. Burke, Local search for the surgery admission planning problem, to appear in Journal of Heuristics.