A generalized linear programming model for nurse scheduling
1998
European Journal of Operational Research
1
107
1-18
Journal_Article
Personnel_Planning_and_Scheduling
Algorithms_Exact||Mathematical_programming_(Mixed)_Integer||Mathematical_programming_Linear
Tactical||Operational_Offline
No
No
Article Link
Jaumard, B. S., Frederic; Vovor, Tsevi. (1998). A generalized linear programming model for nurse scheduling. [Journal Article]. European Journal of Operational Research, 107(1), 1-18.
This paper presents a 0-1 column generation model with a resource constrained shortest path auxiliary problem for nurse scheduling. The master problem finds a configuration of individual schedules to satisfy the demand coverage constraints while minimizing salary costs and maximizing both employee preferences and team balance. A feasible solution of the auxiliary problem is an acceptable schedule for a given nurse, with respect to collective agreement requirements such as seniority, workload, rotations and days off. We define a new resource structure in the auxiliary problem in order to take into account the complex collective agreement rules specific to the nurse scheduling problem. This model generalizes further the previous formulations discussed in the literature and can be viewed as a general scheme for complex personnel scheduling problems, especially in the context of organizations which operate around the clock. Solution methods and preliminary test results are discussed.