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 14<br />
|V ars| = |Shifts| · |<strong>Doctor</strong>s| · |Schedule|<br />
= 4 · m · n = 4 · 6 · 100<br />
= 2400<br />
Given 10 constraints, the total number of constraints for this problem becomes:<br />
|Equations| = |Shifts| · |<strong>Doctor</strong>s| · |Schedule| · |Constraints|<br />
= 4 · m · n · 10 = 4 · 6 · 100 · 10<br />
= 24000<br />
Commonly, problems are big if they have more than 2500 variables and 10000 equations.<br />
This is not ruling out that any larger problems can not be solved, as techniques (i.e.<br />
Cutting-plane method, Branch and cut) exist that, using the constraints, can limit the<br />
search region of the problem. A topic not addressed in this project.