Aickelin, U. and K. Dowsland, “Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem,” Journal of Scheduling
(3), 139–153 (2000).CrossRef
Aickelin, U. and K. Dowsland, “An indirect algorithm for a nurse-scheduling problem,” Computers & Operations Research
(5), 761–778 (2004).CrossRef
Bard, J. F. and H. W. Purnomo, “Preference scheduling for nurses using column generation,” European Journal of Operational Research
(2), 510–534 (2005a).CrossRef
Bard, J. F. and H. W. Purnomo, “Hospital-wide reactive scheduling of nurses with preference considerations,” IIE Transactions on Operations Engineering, 37(7), 589–608 (2005b).
Bard, J. F. and H. W. Purnomo, “A column generation-based approach to solve the preference scheduling problem for nurses with downgrading,” Socio-Economic Planning Sciences
(3), 193–213 (2005c).CrossRef
Berrada, I., J. A. Ferland, and P. Michelon, “A multi-objective approach to nurse scheduling with both hard and soft constraints,” Socio-Economic Planning Sciences
(3), 183–193 (1996).CrossRef
Brusco, M. J. and L. W. Jacobs, “Cost analysis of alternative formulations for personnel scheduling in continuously operating organisations,” European Journal of Operational Research
(2), 249–261 (1995).CrossRef
Burke, E. K., P. De Causmaecker, and G. Vanden Berghe, “A hybrid tabu search algorithm for the nurse rostering problem,” in: B. McKay et al. (Eds.), Simulated Evolution and Learning, Lecture Notes in Artificial Intelligence. Springer, Berlin (1999), Vol. 1585, pp. 187–194.
Burke, E. K., P. I. Cowling, P. De Causmaecker, and G. Vanden Berghe, “A memetic approach to the nurse rostering problem,” Applied Intelligence
(3), 199–214 (2001).CrossRef
Burke, E. K., P. De Causmaecker, and G. Vanden Berghe, “Novel meta-heuristic approaches to nurse rostering problems in Belgian hospitals, Chap. 44, in J. Leung (Ed.), Handbook of Scheduling: Algorithms, Models, and Performance Analysis, CRC Press, Boca Raton, FL (2004a), pp. 44:1–44:18.
Burke, E. K., P. De Causmaecker, G. Vanden Berghe, and H. Van Landeghem, “The state of the art of nurse rostering,” Journal of Scheduling
(6), 441–499 (2004b).CrossRef
Caprara, A., M. Fischeti, and P. Toth. “A heuristic method for the set covering problem,” Operations Research, 47(5), 730–743 (1999).
Caprara, A., M. Monaci, and P. Toth, “Models and algorithms for a staff scheduling problem,” Mathematical Programming, Series B
, 445–476 (2003).CrossRef
Cheng, B. M. W., J. H. M. Lee, and J. C. K. Wu, “A nurse rostering system using constraint programming and redundant modeling,” IEEE Transactions in Information Technology in Biomedicine
(1), 44–54 (1997).CrossRef
Crainic, T. G., A. Frangioni, and B. Gendron, “Bundle-based relaxation methods for multicommodity capacitated fixed charge network design,” Discrete Applied Mathematics
, 73–99 (2001).CrossRef
De Causmaecker, P. and G. Vanden Berghe, “Relaxation of coverage constraints in hospital personnel rostering,” in: E. K. Burke and P. De Causmaecker (Eds.), Practice and Theory of Automated Timetabling, Vol. IV, 4th International Conference, PATAT 2002, Gent, Belgium, LNCS, Springer, Berlin (2003), Vol. 2740, pp. 129–147.
Dowsland, K. A., “Nurse scheduling with tabu search and strategic oscillation,” European Journal of Operational Research
(2–3), 393–407 (1998).CrossRef
Emmons, H., “Work-force scheduling with cyclic requirements and constraints on days off, weekends off, and work stretch,” IIE Transactions, 17(1), 8–15 (1985).
Ernst, A.T., H. Jiang, M. Krishnamoorthy, and D. Sier, “Staff scheduling and rostering: a review of applications, methods and models,” European Journal of Operational Research
, 3–27 (2004).CrossRef
Ferland, J.A., I. Berrada, I. Nabli, B. Ahiod, P. Michelon, V. Gascon, and E. Gagné, “Generalized assignment type goal programming problem: application to nurse scheduling,” Journal of Heuristics
, 391–413 (2001).CrossRef
Frangioni, A. and G. Gallo, “A bundle dual-ascent approach to linear multicommodity min-cost flow problems,” INFORMS Journal on Computing, 11, 370–393 (1999).
Griesmer, H., “Self-scheduling turned us into a winning team,” Management Decisions, 56(12), 21–23 (1993).
Howell, J. P., “Cyclical scheduling of nursing personnel,” Hospital J.A.H.A., 40, 77–85 (1998).
Isken, M., “An implicit tour scheduling problem with application in healthcare,” Annals of Operations Research
, 91–109 (2004).CrossRef
Jaumard, B., F. Semet, and T. Vovor, “A generalized linear programming model for nurse scheduling,” European Journal of Operational Research
, 1–18 (1998).CrossRef
Kawanaka, H., K. Yamamoto, T. Yoshikawa, T. Shinogi, and S. Tsuruoka, “Genetic algorithm with constraints for the nurse scheduling problem,” in: Proceedings of Congress on Evolutionary Computation, IEEE Press, Seoul, South Korea (2001), Vol. 2, pp. 1123–1130.
Kimball, B. and E. O’Neil, “The American nursing shortage,” The Robert Wood Johnson Foundation, Princeton, NJ (2002).
Lau, H.C., “On the complexity of manpower shift scheduling,” Computers & Operations Research
(1), 93–102 (1996).CrossRef
Lemarechal, C., “Nondifferentiable optimization,” in: G. L. Nemhauser, A. H. G. Rinnooy Kan, and M. J. Todd (Eds.), Handbooks in Operations Research and Management Science, Vol. 1: Optimization, North-Holland, Amsterdam, The Netherlands (1989), pp. 529–572.
Meyer auf’ m Hofe, H. “ComPlan/SIEDAPlan: personnel assignment as a problem of hierarchical constraint satisfaction,” in: Proceedings of the 3rd International Conference on the Practical Application of Constraint Technology, London, (1997), pp. 257–271.
Meyer auf’ m Hofe, H. “Solving rostering tasks as constraint optimisation, in E.K Burke and W. Erben (Eds.), Practice and Theory of Automated Timetabling, Vol. III, 3rd International Conference, PATAT 2000, Konstanz, Germany, LNCS, Vol. 2079, pp. 191–212, Springer, Berlin (2001).
Millar, H.H. and M. Kiragu, “Cyclic and non-cyclic scheduling of 12-hour shift nurses by network programming,” European Journal of Operational Research
, 582–592 (1998).CrossRef
Miller, H.E., W.P. Pierskalla, and G. J. Rath, “Nurse scheduling using mathematical programming,” Operations Research, 24(5), 857–870 (1976).
Nemhauser, G.L. and L.A. Wolsey, Integer and Combinatorial Optimization, Wiley, New York (1988).
Nonobe, K. and T. Ibaraki, “A tabu search approach to the constraint satisfaction problem as a general problem solver,” European Journal of Operational Research
, 599–623 (1998).CrossRef
Petrovic, S., G. Beddoe, and G. Vanden Berghe, “Storing and adapting repair experiences in employee rostering,” in: E. K. Burke and P. De Causmaecker (Eds.), Practice and Theory of Automated Timetabling, Vol. IV, 4th International Conference, PATAT 2002, Gent, Belgium, LNCS, (2003), Vol. 2740, pp. 148–165.
Pierskalla, W.P. and D.J. Brailer, “Applications of operations research in health care delivery,” Handbooks in Operations Research and Management Science, North Holland, Amsterdam, The Netherlands (1994), Vol. 6, pp. 469–505.
Randhawa, S.U. and D. Sitompul, “A heuristic-based computerized nurse scheduling system,” Computer & Operations Research
(8), 837–844 (1993).CrossRef
Spratley, E., A. Johnson, J. Sochalski, M. Fritz, and W. Spencer, “The registered nurse population,” Findings from the National Sample Survey of Registered Nurses,” U.S. Department of Health and Human Services (2000).
Topaloglu, S. and I. Ozkarahan, “An implicit goal programming model for the tour scheduling problem considering the employee work preferences,” Annals of Operations Research
, 135–158 (2004).CrossRef
Valouxis, C. and E. Housos, “Hybrid optimization techniques for the workshift and rest assignment of nursing personnel,” Artificial Intelligence in Medicine
, 155–175 (2000).CrossRef
Warner, D.M., “Scheduling nursing personnel according to nursing preference: a mathematical programming approach,” Operations Research
(5), 842–856 (1976).CrossRef