The Doctor Rostering Problem - Asser Fahrenholz
The Doctor Rostering Problem - Asser Fahrenholz The Doctor Rostering Problem - Asser Fahrenholz
Chapter 6. The DRP Program 39 Figure 6.7: The codes window (a) RDO enabled (b) RDO partially enabled (c) RDO disabled Figure 6.8: RDO enabled and disabled The final option available to the user is optimising a schedule. When a schedule has been generated, the optimise button is enabled and the user can now optimise the schedule shown in the schedule-view. This button initiates the Simulated Annealing algorithm described in section 4.3.4, on the current schedule.
Chapter 6. The DRP Program 40 Figure 6.9: The main window w. generated schedule 6.2.1 Measuring the quality of the solution The status bar in the bottom of the application window shows various solution mea- surements: Z(S) the heuristic value of the solution. V(S) the number of hard constraint violations. Cons is a measurement of how constrained the problem is. If the problem is 100% constrained, no doctors can be assigned to any shifts without breaking a hard constraint. It is an average of how many doctors violate one or more rules when assigned to a shift, over all shifts. Importing shifts and adding RDO to the schedule are factors that raises this measurement. 6.3 End user feedback Much like Dias et al. [7], who also develops a user interface, the end user of the software program described in this chapter, gains the most in time spent creating the schedule. The gathering of information from the workforce is still a tedious process, though much improved through the import-function, and the schedule is still inspected manually after it has been created by the software. It is estimated that the total time required to produce a schedule, going from 5-10 hours, will be around 0.5 hours. Should previous
- Page 1 and 2: TECHNICAL UNIVERSITY OF DENMARK The
- Page 3 and 4: TECHNICAL UNIVERSITY OF DENMARK Abs
- Page 5 and 6: Acknowledgements Foremost, I would
- Page 7 and 8: Contents vi 4.3.1 A construction he
- Page 9 and 10: List of Figures 4.1 The transformat
- Page 11 and 12: List of Algorithms 4.1 Adaptive gre
- Page 13 and 14: Chapter 1. Introduction and problem
- Page 15 and 16: Chapter 2. The Doctor Rostering Pro
- Page 17 and 18: Chapter 2. The Doctor Rostering Pro
- Page 19 and 20: Chapter 3 A mathematical model for
- Page 21 and 22: Chapter 3. The model and design 10
- Page 23 and 24: Chapter 3. The model and design 12
- Page 25 and 26: Chapter 3. The model and design 14
- Page 27 and 28: Chapter 4. Solving the DRP 16 it in
- Page 29 and 30: Chapter 4. Solving the DRP 18 4.3.1
- Page 31 and 32: Chapter 4. Solving the DRP 20 Given
- Page 33 and 34: Chapter 4. Solving the DRP 22 Since
- Page 35 and 36: Chapter 4. Solving the DRP 24 1. Co
- Page 37 and 38: Chapter 4. Solving the DRP 26 decre
- Page 39 and 40: Chapter 4. Solving the DRP 28 This
- Page 41 and 42: Chapter 4. Solving the DRP 30 Simul
- Page 43 and 44: Chapter 5. Optimal solution 32 The
- Page 45 and 46: Chapter 6 The DRP Program Through t
- Page 47 and 48: Chapter 6. The DRP Program 36 Figur
- Page 49: Chapter 6. The DRP Program 38 of th
- Page 53 and 54: Chapter 7 Metaheuristic tests This
- Page 55 and 56: Chapter 7. Tests, results and discu
- Page 57 and 58: Chapter 7. Tests, results and discu
- Page 59 and 60: Chapter 7. Tests, results and discu
- Page 61 and 62: Chapter 7. Tests, results and discu
- Page 63 and 64: Chapter 7. Tests, results and discu
- Page 65 and 66: Chapter 8. Future considerations 54
- Page 67 and 68: Chapter 8. Future considerations 56
- Page 69 and 70: Chapter 9. Conclusion 58 The three
- Page 71 and 72: Appendix A. Implementation 60 27 //
- Page 73 and 74: 2 Appendix A. Implementation 62 3 i
- Page 75 and 76: Appendix A. Implementation 64 A.3 G
- Page 77 and 78: Appendix A. Implementation 66 97 wh
- Page 79 and 80: Appendix A. Implementation 68 27 su
- Page 81 and 82: Appendix A. Implementation 70 119 P
- Page 83 and 84: Appendix A. Implementation 72 64 br
- Page 85 and 86: Appendix A. Implementation 74 28 Ch
- Page 87 and 88: Appendix B GAMS Model This chapter
- Page 89 and 90: Appendix B. GAMS Model 78 46 c(day
- Page 91 and 92: Appendix B. GAMS Model 80 109 B1( f
- Page 93 and 94: Appendix B. GAMS Model 82 **** REPO
- Page 95 and 96: Appendix B. GAMS Model 84 B.3 The s
- Page 97 and 98: Appendix B. GAMS Model 86 B.3.3 The
- Page 99 and 100: Appendix C. Tests 88 C.1.1 Instance
Chapter 6. <strong>The</strong> DRP Program 39<br />
Figure 6.7: <strong>The</strong> codes window<br />
(a) RDO enabled (b) RDO partially enabled (c) RDO disabled<br />
Figure 6.8: RDO enabled and disabled<br />
<strong>The</strong> final option available to the user is optimising a schedule. When a schedule has been<br />
generated, the optimise button is enabled and the user can now optimise the schedule<br />
shown in the schedule-view. This button initiates the Simulated Annealing algorithm<br />
described in section 4.3.4, on the current schedule.
Change language