The Doctor Rostering Problem - Asser Fahrenholz

Chapter 9. Conclusion 58
The three heuristics are implemented in a program, written in Java and the program
features are presented. The program is able to model the problem and all of the con-
straints described by the end user. It consists of an intuitive, non-obtrusive layout with
easy to configure settings, able to present a solution to a schedule of any length, with
any number of doctors. Several measures of the solution value are displayed to the user
to allow for solution evaluation. Due to the time horizon on the project, the program is
not bugfree and several parts are hard coded, but it does deliver as promised.
A more thorough testing of the heuristics indicates that the partial enumeration of
the solution space is able to improve the solutions within an acceptable time frame in
the perspective of time and solution trade-off. Larger enumerations is out of bounds
compared to the limitations set down by the end user and the possible gain compared
to the implemented enumeration is too small.
Finally, the reader is presented with considerations for further implementations and
improvements, that could possibly improve the quality of the solutions found and the
implementation respectively. This includes a delta function allowing for the difference in
objective function value to be calculated instead of the entire objective function value.
The DRP has been discussed, analysed, modelled, solved and tested. It is, however,
found that the problem is too specific for the solution to be applied to any other envi-
ronment, such as larger hospitals or other private doctor offices. For this to be the case,
a more dynamic setup of constraints, shifts and the incorporation of qualification levels
is needed.