Cyclic preference scheduling for nurses using branch and price

Naval Research Logistics

Volumn 54, Issue 2, 2007, Pages 200-220

  Purnomo, Hadi W ^a   Bard, Jonathan F ^b  

^a AMR   (United States)

^b UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

Branch and price; Column generation; Cyclic scheduling; Feasibility heuristics; Nurse scheduling

Indexed keywords

COLUMN GENERATION; CYCLIC SCHEDULING; FEASIBILITY HEURISTICS; NURSE SCHEDULING;

CONSTRAINT THEORY; HEURISTIC METHODS; INTEGER PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION; SCHEDULING; SOCIETIES AND INSTITUTIONS;

JOB ANALYSIS;

EID: 33847733478     PISSN: 0894069X     EISSN: 15206750     Source Type: Journal    
DOI: 10.1002/nav.20201     Document Type: Article

References (41)

1. U. Aickelin, and K. Dowsland, An indirect algorithm for a nurse-scheduling problem, Comput Oper Res 31 (2004), 761-778.
2. U. Aickelin, and P. White, Building better nurse scheduling algorithms, Ann Oper Res 128 (2004), 159-177.
3. J.F. Bard, and H.W. Purnomo, Hospital-wide reactive scheduling of nurses with preference considerations, IIE Trans Oper Eng 37(7) (2005), 589-608.
4. J.F. Bard, and H.W. Purnomo, Preference scheduling for nurses using column generation. Eur J Oper Res 164 (2005), 510-534.
5. J.F. Bard, and H.W. Purnomo, A column generation-based approach to solve the preference scheduling problem for nurses with downgrading. Socio-Econ Plan Sci 39(3) (2005), 193-213.
6. C. Barnhart, C.A. Hane, and P.H. Vance, Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems. Oper Res 48(2) (2000), 318-326.
7. C. Barnhart, E.L. Johnson, G.L. Nemhauser, M.W.P. Savelsbergh, and P.H. Vance, Branch-and-price: Column generation for solving huge integer programs, Oper Res 46(3) (1998), 316-329.
8. J.J. Bartholdi III, A guaranteed-accuracy round-off algorithm for cyclic scheduling and set covering. Oper Res 29(3) (1981), 501-510.
9. S.E. Bechtold, and L.W. Jacobs, The equivalence of general set-covering and implicit integer programming formulations for shift scheduling. Nav Res Logist 43(2) (1996), 233-249.
10. I. Berrada, J.A. Ferland, and P. Michelon, A multi-objective approach to nurse scheduling with both hard and soft constraints. Socio-Econ Plan Sci 30(3) (1996), 183-193.
11. M.J. Brusco, Solving personnel tour scheduling problems using the dual all-integer cutting plane. IIE Trans Oper Eng 30(9) (1998), 835-844.
12. E.K. Burke, P.D. Causmaecker, and G.V. Berghe, "A hybrid tabu search algorithm for the nurse rostering problem," Simulated Evolution and Learning B. McKay et al. (Editors) Lecture Notes in Artificial Intelligence 1585, Springer, Berlin, 1998, pp. 187-194.
13. E.K. Burke, P.D. Causmaecker, G.V. Berghe, and H. Van Landeghem, The state of the art of nurse rostering. J Schedul 7(6) (2004), 441-499.
14. R.N. Burns, and M.W. Carter, Work force size and single shift schedules with variable demands. Manage Sci 31(5) (1985), 599-607.
15. A. Caprara, M. Monaci, and P. Toth, Models and algorithms for a staff scheduling problem, Math Progr B 98 (2003), 445-476.
16. B. Cheang, H. Li, A. Lim, and B. Rodrigues, Nurse rostering problems - A bibliographic survey. Eur J Oper Res 151 (2003), 447-460.
17. B.M.W. Cheng, J.M.L. Lee, and J.C.K. Wu, A nurse rostering system using constraint programming and redundant modeling, IEEE Trans Inform Technol Biomed 1(1) (1997), 44-54.
18. K.A. Dowsland, Nurse scheduling with tabu search and strategic oscillation. Eur J Oper Res 106 (1998), 393-407.
19. Du Merle, O.D. Villeneuve, J. Desrosiers, and P. Hansen, Stabilized column generation. Discrete Math 194 (1999), 229-237.
20. H. Emmons, Work-force scheduling with cyclic requirements and constraints on days off, weekends off, and work stretch. IIE Trans 17(1) (1985), 8-15.
21. A.T. Ernst, H. Jiang, M. Krishnamoorthy, and D. Sier, Staff scheduling and rostering: A review of applications, methods and models, Eur J Oper Res 153 (2003), 3-27.
22. G. Felici, and C. Gentile, A polyhedral approach for the staff rostering problem. Manage Sci 50(3) (2004), 381-393.
23. J.A. Ferland, I. Berrada, I. Nabli, B. Ahiod, P. Michelon, V. Gascon, and E. Gagné, Generalized assignment type goal programming problem: Application to nurse scheduling. J Heurist 7 (2001), 391-413.
24. H. Griesmer, Self-scheduling turned us into a winning team. Manage Decisions 56(12) (1993), 21-23.
25. J.P. Howell, Cyclical scheduling of nursing personnel. Hosp JAHA 40 (1998), 77-85.
26. M.W. Isken, An implicit tour scheduling model with applications in healthcare. Ann Oper Res 128 (2004), 91-109.
27. B. Jaumard, F. Semet, and T. Vovor, A generalized linear programming model for nurse scheduling. Eur J Oper Res 107 (1998), 1-18.
28. H. Kawanaka, K. Yamamoto, T. Yoshikawa, T. Shinogi, and S. Tsuruoka, "Genetic algorithm with constraints for the nurse scheduling problem," Proceedings of Congress on Evolutionary Computation, IEEE Press 2, Seoul, South Korea, 2001, pp. 1123-1130.
29. H.C. Lau, On the complexity of manpower shift scheduling, Comput Oper Res 23(1) (1996), 93-102.
30. M.E. Lübbecke, and J. Desrosiers, Selected topics in column generation, Oper Res 53(6) (2005), 1007-1023.
31. H.E. Miller, W.P. Pierskalla, and G.J. Rath, Nurse scheduling using mathematical programming, Oper Res 24(5) (1976), 857-870.
32. K. Nonobe, and T. Ibaraki, A tabu search approach to the constraint satisfaction problem as a general problem solver, Eur J Oper Res 106 (1998), 599-623.
33. M. Okada, An approach to the generalized nurse scheduling problem - Generation of a declarative program to represent institution-specific knowledge. Comput Biomed Res 28 (1992), 417-434.
34. W. Pierskalla, and D.J. Brailer. "Applications of operations research in health care delivery," Handbooks in Operations Research & Management Science 6, Amsterdam, North Holland, 1994, pp. 469-505.
35. E.R. Pinker, and R.C Larson, Optimizing the use of contingent labor when demand is uncertain, Eur J Oper Res 144(1) (2003), 39-55.
36. V. Quan, Retail labor scheduling, OR/MS Today 31(6) (2005), 33-35.
37. S.U. Randhawa, and D. Sitompul, A heuristic-based computerized nurse scheduling system, Comput Oper Res 20(8) (1993), 837-844.
38. C. Valouxis, and E. Housos, Hybrid optimization techniques for the workshift and rest assignment of nursing personnel, Artif Intell Med 20 (2000) 155-175.
39. F. Vanderbeck, On Dantzig-Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm, Oper Res 48(1) (2000), 111-128.
40. D.M. Warner, Scheduling nursing personnel according to nursing preference: A mathematical programming approach, Oper Res 24(5) (1976), 842-856.
41. L.A. Wolsey, Integer Programming, Wiley, New York, 1998.