Publication Type

Journal Article

Version

acceptedVersion

Publication Date

5-2013

Abstract

We study a real-world problem arising from the operations of a hospital service provider, which we term the master physician scheduling problem. It is a planning problem of assigning physicians’ full range of day-to-day duties (including surgery, clinics, scopes, calls, administration) to the defined time slots/shifts over a time horizon, incorporating a large number of constraints and complex physician preferences. The goals are to satisfy as many physicians’ preferences and duty requirements as possible while ensuring optimum usage of available resources. We propose mathematical programming models that represent different variants of this problem. The models were tested on a real case from the Surgery Department of a local government hospital, as well as on randomly generated problem instances. The computational results are reported together with analysis on the optimal solutions obtained. For large-scale instances that could not be solved by the exact method, we propose a heuristic algorithm to generate good solutions.

Keywords

scheduling, optimization, health service, master physician scheduling and rostering problem, mathematical programming, preferences

Discipline

Artificial Intelligence and Robotics | Health and Medical Administration | Operations Research, Systems Engineering and Industrial Engineering

Research Areas

Intelligent Systems and Optimization

Publication

Journal of the Operations Research

Volume

64

Issue

3

First Page

410

Last Page

425

ISSN

0160-5682

Identifier

10.1057/jors.2012.48

Publisher

Palgrave

Copyright Owner and License

Authors

Additional URL

https://doi.org/10.1057/jors.2012.48

Download

Share

COinS