Contributed Session Thu.2.MA 376

Thursday, 13:15 - 14:45 h, Room: MA 376

Cluster 12: Life sciences & healthcare [...]

Scheduling, assignment and matching in healthcare


Chair: Sarah Kirchner



Thursday, 13:15 - 13:40 h, Room: MA 376, Talk 1

Andrea Trautsamwieser
A branch-and-price approach for solving medium term home health care planning problems

Coauthor: Patrick Hirsch


Medium term home health care planning is important because of additional legal working time regulations. Moreover, the clients (resp. nurses) prefer to know their visiting days and times (resp. working days and times) beforehand. In Austria, the planning of these services is typically done manually. However, several constraints make the planning a time consuming task. Usually, the clients have to be visited several times a week for a certain treatment at a certain time by appropriately skilled nurses. Additionally, working time regulations such as maximum allowed working time, breaks, and rest periods have to be considered. Furthermore, some clients need to be visited by two or more nurses at the same time and some visits cannot start before a certain time gap after another visit has elapsed. The objective is to minimize the total travelling times of the nurses. In order to solve this problem efficiently an algorithm is developed combining a Branch-and-Price approach and a metaheuristic solution approach based on Variable Neighbourhood Search. The algorithm is tested with real life data and compared to the solutions obtained with standard solver software.



Thursday, 13:45 - 14:10 h, Room: MA 376, Talk 2

Nahid Jafariasbagh
Optimal individual matching to evaluate treatment in the stroke trails

Coauthors: Leonid Churilov, John Hearne


The aim of this work is to make an individual matching of patients with multiple attributes from two groups of therapy. The problem is investigating the outcomes of the two groups of patients in the stroke trails which some treated by alteplase and the others controlled by placebo.
To address the problem we modeled the problem as an integer program using assignment formulation. Our proposed models will consider the trade-off between the three objectives: maximize the number of matches, minimize the age difference, and minimize the stroke severity index difference. We applied our models for two data sets EPITHET and NINDS. To demonstrate the relationship between the sample size and the number of matches we did a simulation by generating thousands of patients and proved our assumptions.



Thursday, 14:15 - 14:40 h, Room: MA 376, Talk 3

Sarah Kirchner
Appointment scheduling in a hospital environment

Coauthor: Marco L├╝bbecke


Currently appointments for patients are scheduled locally in most german hospitals. In every hospital unit a scheduler assigns appointments sequentially to incoming treatment requests. As the settlement amount for a patient is determined by his diagnoses and received treatments and not by the length of his hospitalization it is desirable for hospitals to reduce the average length of hospitalization. Therefore it is necessary to coordinate appointments for all treatments on a patients care pathway. This problem can be seen as a new variant of the well known job shop scheduling problem where patients correspond to jobs and treatments for patients correspond to tasks of jobs. The problem is also related to scheduling problems with calendars, as resources in a hospital are mostly not available at night and treatments can not be interrupted when the resource becomes unavailable. The objective of our problem is to minimize the average number of days of hospitalization. In this talk we introduce this new scheduling problem and present first models and solution approaches.


  Getting Payday Loans In California should be thought of many times. If you have already decided to take Levitra For Sale, be sure to consult a doctor, you don't have any contraindications and act strictly due to a prescription.