Paper Info
Title
Master physician scheduling problem.
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. Journal of the Operational Research Society (2013) 64, 410-425. doi:10.1057/jors.2012.48 Published online 16 May 2012
Year
DOI
Venue
2013
10.1057/jors.2012.48
JORS
Keywords
Field
DocType
mathematical programming,optimization,scheduling problem,scheduling
Job shop scheduling,Time horizon,Fair-share scheduling,Scheduling (computing),Computer science,Heuristic (computer science),Operations research,Service provider,Nurse scheduling problem,Dynamic priority scheduling,Management science,Operations management
Journal
Volume
Issue
ISSN
64
3
0160-5682
Citations 
PageRank 
References 
7
0.54
18
Authors
2
Name
Order
Citations
PageRank
Aldy Gunawan114212.18
Hoong Chuin Lau273991.69