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. <strong>The</strong> model and design 12<br />
B2 All shifts assigned should be divided equally among all doctors.<br />
δB2<br />
⎛<br />
⎝max<br />
k<br />
<br />
i,j∈sa<br />
xijk − min<br />
k<br />
<br />
i,j∈sa<br />
xijk<br />
⎞<br />
⎠ (B2)<br />
B3 No doctor should have two noon shifts nor two afternoon shifts two days in a row:<br />
⎛<br />
min δB3 ⎝ <br />
i,j<br />
yijk3<br />
⎞<br />
⎠ ∀ k<br />
st. xijk + x (i+1)jk = 1 + yijk3 − tijk3<br />
∀i = {1 . . . n − 1}, j ∈ sa, k<br />
B4 No doctor should have the afternoon shift the day after an evening shift:<br />
min δB4<br />
<br />
i<br />
yik4<br />
<br />
∀ k<br />
st. bi4k + x (i+1)3k = 1 + yik4 − tik4<br />
∀i = {1 . . . n − 1}, k<br />
B5 No doctor should have the noon shift the same day as an evening shift:<br />
min δB5<br />
<br />
i<br />
yik5<br />
<br />
∀ k<br />
st. bi4k + xi2k = 1 + yik5 − tik5<br />
∀i, k<br />
(B3)<br />
(B4)<br />
(B5)<br />
B6 No doctor should have the noon shift the day after an afternoon shift and vice verca:<br />
min δB6a<br />
<br />
i<br />
yik6a<br />
<br />
∀ k<br />
st. xi3k + x (i+1)2k = 1 + yik6a − tik6a<br />
min δB6b<br />
∀i = {1 . . . n − 1}, k<br />
<br />
i<br />
yik6b<br />
<br />
∀ k<br />
st. xi2k + x (i+1)3k = 1 + yik6b − tik6b<br />
∀i = {1 . . . n − 1}, k<br />
(B6a)<br />
(B6b)