The Doctor Rostering Problem - Asser Fahrenholz
The Doctor Rostering Problem - Asser Fahrenholz
The Doctor Rostering Problem - Asser Fahrenholz
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Chapter 3<br />
A mathematical model for the<br />
DRP<br />
This chapter describes the mathematical model for the doctor rostering problem stated<br />
by the medical practice. A number of constraints was given; some which has to be satis-<br />
fied (called hard constraints), and some which are not essential, but are preferably and<br />
as much as possible satisfied (the soft constraints). <strong>The</strong> hard constraints also partitions<br />
the solution space into feasible and infeasible. A solution is said to be feasible when no<br />
hard constraints are violated and infeasible otherwise. In this project, I model the DRP<br />
as a minimisation problem.<br />
3.1 Parameters<br />
<strong>The</strong> constraints have all been thoroughly discussed with the medical practice throughout<br />
the project. It should be noted that these all stem from personal point-of-views, wishes<br />
etc. as the medical practice is a private one, and not a public institution, which would<br />
no doubt be heavily influenced by union-restrictions and/or laws.<br />
In describing the constraints, the following binary variable is used:<br />
xijk =<br />
1 if on day i, shift j, the doctor is k<br />
0 otherwise<br />
And the following parameters are introduced:<br />
8