This research addresses a shift scheduling problem in which physicians are assigned to demand periods.
We develop a reduced set covering approach that requires shift templates to be generated for a single day
and compare it to an implicit modeling technique where shift-building rules are implemented as constraints.
Both techniques allow full flexibility in terms of different shift starting times and lengths as well
as break placements. The objective is to minimize the paid out hours under the restrictions given by the
labor agreement. Furthermore, we integrate physician preferences and fairness aspects into the scheduling
model. Computational results show the efficiency of the reduced set covering formulation in comparison
to the implicit modeling approach.
Dieser Eintrag ist Teil der Universitätsbibliographie.
Search Authors in