Scheduling Doctors for Clinical Training Unit Rounds Using Tabu Optimization

White, Christine; White, George M.

doi:10.1007/978-3-540-45157-0_8

Cited by 20 publications

(17 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…One-year schedules that considered oncall service and vacation requests were obtained. White and White [39] addressed the problem of scheduling hospital rounds by speciality for teams.…”

Section: Literature Reviewmentioning

confidence: 99%

Flexible shift scheduling of physicians

Brunner

Bard

Kolisch

2009

Health Care Manag Sci

104

View full text Add to dashboard Cite

This research addresses a shift scheduling problem in which physicians at a German university hospital are assigned to demand periods over a planning horizon that can extend up to several weeks. When performing the scheduling it is necessary to take into account a variety of legal and institutional constraints that are imposed by a national labor agreement, which governs all physicians in German university hospitals. Currently, most medical departments develop their staff schedules manually at great cost and time. To solve the problem, a new modeling approach is developed that requires shifts to be generated implicitly. Rather than beginning with a predetermined number of shift types and start times, shifts are allowed to start at every pre-defined period in the planning horizon and extend up to 13 h with an hour-long break included. The objective is to find an assignment such that the total hours that have to be paid out as overtime are minimal under the restrictions given by the labor agreement. The problem is formulated as a mixed-integer program and solved with CPLEX. During the solution process individual lines-of-work are constructed for each physician. Using data from an anesthesia department, computational results indicate that high quality schedules can be obtained much more quickly than by current practice.

show abstract

“…One-year schedules that considered oncall service and vacation requests were obtained. White and White [39] addressed the problem of scheduling hospital rounds by speciality for teams.…”

Section: Literature Reviewmentioning

confidence: 99%

Flexible shift scheduling of physicians

Brunner

Bard

Kolisch

2009

Health Care Manag Sci

104

View full text Add to dashboard Cite

show abstract

“…White and White [36] assign hospital rounds by specialty for teams containing senior, junior physicians as well as residents. They implement a metaheuristics in combination with a logic constraint algorithm to obtain monthly schedules.…”

Section: Literaturementioning

confidence: 99%

Long term staff scheduling of physicians with different experience levels in hospitals using column generation

Brunner

Edenharter

2011

Health Care Manag Sci

View full text Add to dashboard Cite

We present a strategic model to solve the long-term staffing problem of physicians in hospitals using flexible shifts. The objective is to minimize the total number of staff subject to several labor agreements. A wide range of legal restrictions and facility-specific staffing policies are considered. In general, the model is capable to incorporate different experience levels. In the simplest version the model decides about the number of staff for two experience levels, i.e. the number of residents (low experience) versus specialists (high experience). Shifts are constructed implicitly by the model and may have different starting times and several lengths. This allows more flexibility in the scheduling process. We formulate the problem as a mixed-integer program and solve it applying a column generation based heuristic. Using data provided by an anesthesia department of an 1100-bed hospital, computational results demonstrate the usage of the model as decision supporting tool when staffing decision are made by hospital management.

show abstract

“…However, it is also possible to accept the tabu solution if it fulfills some conditions, which are determined by the so called aspiration criteria (i.e., the solution is tabu but has the best objective function value so far). Although tabu search has been used to solve similar problems with rotating workforce scheduling [15], [34], [16], [12], [38], [19], to the best of our knowledge tabu search has not been used to directly solve the problem we consider in this paper. Rotating workforce scheduling involves typically different constraints compared to nurse scheduling, and what also makes the rotating workforce scheduling different from nurse scheduling is that the schedule is cyclic.…”

Section: Tabu Search For Rotating Workforce Schedulingmentioning

confidence: 99%

“…Constraint processing has been used for nurse scheduling in [6]. Examples of the use of tabu search for nurse scheduling and related workforce scheduling problems are [15], [34], [16], [12], [38], and [19]. The combination of tabu search with other approaches for nurse scheduling has been also considered in the literature.…”

Section: Introductionmentioning

confidence: 99%

Heuristic Methods for Automatic Rotating Workforce Scheduling

Musliu¹

2006

IJCIR

View full text Add to dashboard Cite

Rotating workforce scheduling appears in different forms in a broad range of workplaces, such as industrial plants, call centers, public transportation, and airline companies. It is of a high practical relevance to find workforce schedules that fulfill the ergonomic criteria of the employees, and reduce costs for the organization. In this paper we propose new heuristic methods for automatic generation of rotating workforce schedules. To improve the quality of each heuristic method alone, we further propose the hybridization of these methods. The following methods are proposed: (1)A Tabu Search (TS) based algorithm, (2) A heuristic method based on min-conflicts heuristic (MC), (3) A method that includes in the tabu search algorithm the min-conflicts heuristic (TS-MC) and random walk (TS-RW), (4) A method that includes in the min-conflicts heuristic the tabu mechanism (MC-T), random walk (MC-RW), and both the tabu mechanism and the random walk (MC-T-RW). The appropriate neighborhood structure, tabu mechanism, and fitness function, based on the specifics of the problem are proposed. The proposed methods are implemented and experimentally evaluated on the benchmark examples given in the literature and on the real life test problems, which we collected from a broad range of organizations. Empirical results show that the combination of the min-conflicts heuristic with tabu search can be used to solve this problem very effectively. The hybrid methods improve the performance of the commercial system for generation of rotating workforce schedules and are currently in the procees of being included in a commercial package for automatic generation of rotating workforce schedules.

show abstract

Scheduling Doctors for Clinical Training Unit Rounds Using Tabu Optimization

Cited by 20 publications

References 17 publications

Flexible shift scheduling of physicians

Flexible shift scheduling of physicians

Long term staff scheduling of physicians with different experience levels in hospitals using column generation

Heuristic Methods for Automatic Rotating Workforce Scheduling

Contact Info

Product

Resources

About