The Doctor Rostering Problem - Asser Fahrenholz
The Doctor Rostering Problem - Asser Fahrenholz The Doctor Rostering Problem - Asser Fahrenholz
Chapter 6. The DRP Program 37 Figure 6.4: The main window w. imported shifts If the user is not importing any shifts, the option of adding doctors manually is also available. A set of doctors is needed to generate a schedule, so one of these options must be chosen. Once a set of doctors has been added the buttons Generate (SLOW) and Generate (FAST) will be enabled to the user. They represent a single run of the greedy con- struction heuristic (see section 4.3.1) and the grasp metaheuristic (see section 4.3.3) respectively. Before starting the generation of a schedule, several features are available in the Settings- menu, shown in figure 6.5, that will allow modification of the end-result: Figure 6.5: The settings menu Rule weights allows for modification of the weights of the soft constraints. This en- ables the priority of certain rules over others. Contrary to Nonobe and Ibaraki [18], where an automated weight control mechanism is implemented, the weights
Chapter 6. The DRP Program 38 of the constraints in this project are ultimately left to the end user to decide. The weight-window is shown in figure 6.6. Figure 6.6: The weights window View codes shows the various shift-abbreviations, their meaning, where the shift takes place and what shifts it covers (night, noon, afternoon or evening, or a combination of either). The user can add or delete definitions here. The codes are used when importing shifts. Set code file is for loading another code definition list than the one already loaded. The format used for the codes file is .xls (Microsoft Excel). Rolling Day Off enables the user to select whether the RDO-mechanism should be enabled and for which weeks the RDO should include. Figure 6.8 shows the RDO window. As of now, the mechanism works with six doctors as is the goal. Though a more dynamic algorithm is preferable, time was of the essence when implementing the algorithm. Day starts at 8am specifies whether a day in the sense of shifts starts at 08.00 am or at 00.00 am. Tradition sometimes dictates that the night shift of the 20 th physically lies on the 21 st . The underlying function is to move imported night shifts from day x to day x + 1, and when showing the schedule in the calendar-view, moving them back. Pressing either Generate-button, will result in a generated schedule, showing progress in the status-bar and when the generation of the schedule is done, the value and violations of the schedule. Figure 6.9 on page 40 shows the application window after a schedule has been generated.
- 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: Chapter 6. The DRP Program 36 Figur
- Page 51 and 52: Chapter 6. The DRP Program 40 Figur
- 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
Chapter 6. <strong>The</strong> DRP Program 37<br />
Figure 6.4: <strong>The</strong> main window w. imported shifts<br />
If the user is not importing any shifts, the option of adding doctors manually is also<br />
available. A set of doctors is needed to generate a schedule, so one of these options must<br />
be chosen.<br />
Once a set of doctors has been added the buttons Generate (SLOW) and Generate<br />
(FAST) will be enabled to the user. <strong>The</strong>y represent a single run of the greedy con-<br />
struction heuristic (see section 4.3.1) and the grasp metaheuristic (see section 4.3.3)<br />
respectively.<br />
Before starting the generation of a schedule, several features are available in the Settings-<br />
menu, shown in figure 6.5, that will allow modification of the end-result:<br />
Figure 6.5: <strong>The</strong> settings menu<br />
Rule weights allows for modification of the weights of the soft constraints. This en-<br />
ables the priority of certain rules over others. Contrary to Nonobe and Ibaraki<br />
[18], where an automated weight control mechanism is implemented, the weights
Change language