A generalized linear programming model for nurse scheduling

European Journal of Operational Research

Volumn 107, Issue 1, 1998, Pages 1-18

  Jaumard, Brigitte ^a   Semet, Frédéric ^b   Vovor, Tsevi ^a  

^a GERAD   (Canada)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

Column generation; Constrained shortest path; Health; Nurse scheduling

Indexed keywords

CONSTRAINT THEORY; COST EFFECTIVENESS; CRITICAL PATH ANALYSIS; HEALTH CARE; LINEAR PROGRAMMING; MATHEMATICAL MODELS; NURSING; PROBLEM SOLVING; RESOURCE ALLOCATION;

COLUMN GENERATION MODEL; CONSTRAINED SHORTEST PATH; NURSE SCHEDULING;

WORK-REST SCHEDULES;

EID: 0032072578     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00330-5     Document Type: Article

References (22)

1. Convention collective intervenue entre le Comité patronal de négociation du secteur de la santé et des services sociaux, le souscomité patronal de négociation des centres hospitaliers publics et la Fédération des Affaires Sociales (CSN), C.H.P., 27 avril 1990-31 décembre 1991, Québec, Canada.
2. C. Dagenais, Automated staff scheduling: Description of current system, definition of requirements, cost estimates, Internal Report (June 1992), Royal Victoria Hospital, Montréal, Québec, Canada.
3. R. Hung, Hospital nurse scheduling, Journal of Nursing Administration 25 (7/8) (1995) 21-25.
4. L.D. Smith, A. Wiggins, A computer based nurse scheduling system. Computers and Operations Research 4 (1977) 195-212.
5. M. Anzai, Y. Miura, Computer program for quick work scheduling of nursing staff, Medical Information 12 (1) (1987) 43-52.
6. M. Okada, M. Okada, Prolog-based system for nursing staff scheduling implemented on a personal computer, Computers and Biomedical Research 21 (1988) 53-63.
7. K. Baker, Scheduling a full-time workforce to meet cyclic staffing requirements. Management Science 20 (12) (1974) 1561-1568.
8. R.N. Burns, Manpower scheduling with variable demands and alternate weekends off, INFOR 16 (2) (1978) 101-111.
9. R.N. Burns, G.J. Koop, A modular approach to optimal multiple-shift manpower scheduling, Operations Research 35 (1) (1987) 100-110.
10. D.M. Warner, Scheduling nursing personnel according to nursing preference: A mathematical programming approach, Operations Research 24 (5) (1976) 842-856.
11. H.E. Miller, W.P. Pierskalla, G.J. Rath. Nurse scheduling using mathematical programming, Operations Research 24 (5) (1976) 857-871.
12. I. Ozkarahan, J. Bailey, Goal programming model subsystem of a flexible nurse scheduling support system, IIE Transactions (1988) 306-316.
13. I. Berrada, Planification d'horaires du personnel infirmier dans un établissement hospitalier. Thèse de doctorat (Ph.D.) en Informatique, Université de Montréal (1993).
14. G.B. Dantzig, P. Wolfe, Decomposition principle for linear programs, Operations Research 8 (1960) 101-111.
15. P.C. Gilmore, R.E. Gomory, A linear programming approach to the cutting stock problem, Operations Research 9 (1961) 849-859.
16. P.C. Gilmore, R.E. Gomory, A linear programming approach to the cutting stock problem: Part II, Operations Research 11 (1963) 863-888.
17. J. Desrosiers, Y. Dumas, M.M. Solomon, F. Soumis, Time Constrained Routing and Scheduling, Handbooks in Operations Research and Management Science, Vol. 8 on Network Routing, M.O. Ball et al. (Eds.), Elsevier Science B.V., 1994, 35-139.
18. P. Hansen, B. Jaumard et, M.P. de Aragão, Un algorithme primal de programmation linéaire généralisée pour les programmes mixtes, Comptes-rendus de l'Académie des Sciences de Paris 313 (1) (1991) 557-560.
19. F. Vanderbeck, L.A. Wolsey, An exact algorithm for IP column generation, CORE Discussion Paper 9419, Université catholique de Louvain, Louvain-la-Neuve, Belgium (1994).
20. C. Barnhart, E.L. Johnson, G.L. Nemhauser, M.W.P. Savelsbergh, P.H. Vance, Branch-and-Price: Column generation for solving huge integer programs, in: J.R. Birge, K.G. Murty (Eds.), Mathematical Programming: State of the Art 1994, The University of Michigan, USA.
21. B. Jaumard, F. Semet, T. Vovor, A two-phase resource constrained shortest path algorithm for acyclic graphs, Les Cahiers du GERAD G-96-48, École des Hautes Études Commerciales, Montréal, Canada, H3T 2A7 (1996).
22. J.E. Beasley, N. Christofides, An algorithm for the resource constrained shortest path problem, Networks 19 (1989) 379-394.