A rotation-based branch-and-price approach for the nurse scheduling problem

Bard, J.F., Purnomo, H.W.: Preference scheduling for nurses using column generation. Eur. J. Oper. Res. 164(2), 510–534 (2005). https://doi.org/10.1016/j.ejor.2003.06.046

Barnhart, C., Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P., Vance, P.H.: Branch-and-price: column generation for solving huge integer programs. Oper. Res. 46(3), 316–329 (1998). https://doi.org/10.1287/opre.46.3.316

Beliën, J., Demeulemeester, E.: A branch-and-price approach for integrating nurse and surgery scheduling. Eur. J. Oper. Res. 189(3), 652–668 (2008). https://doi.org/10.1016/j.ejor.2006.10.060

Boyer, V., Gendron, B., Rousseau, L.M.: A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem. J. Sched. 17(2), 185–197 (2014). https://doi.org/10.1007/s10951-013-0338-9

Braekers, K., Janssens, G.K.: Shortest route problem with soft time windows. In: Onggo, S., Kavicka, A. (eds.) The European Simulation and Modelling Conference, pp. 279–283 (2013)

Burke, E.K., Curtois, T.: New approaches to nurse rostering benchmark instances. Eur. J. Oper. Res. 237(1), 71–81 (2014). https://doi.org/10.1016/j.ejor.2014.01.039

Burke, E.K., De Causmaecker, P., Berghe, G.V., Van Landeghem, H.: The state of the art of nurse rostering. J. Sched. 7(6), 441–499 (2004). https://doi.org/10.1023/B:JOSH.0000046076.75950.0b

Ceschia, S., Dang, N., De Causmaecker, P., Haspeslagh, S., Schaerf, A.: The second international nurse rostering competition. Ann. Oper. Res. (2018). https://doi.org/10.1007/s10479-018-2816-0

Ceschia, S., Dang, N., De Causmaecker, P., Haspeslagh, S., Schaerf, A.: Solving the INRC-II nurse rostering problem by simulated annealing based on large-scale neighborhoods. In: Proceedings of the 12th International Conference on Practice and Theory of Automated Timetabling (PATAT-2018) (2018)

Ceschia, S., Dang, N.T.T., De Causmaecker, P., Haspeslagh, S., Schaerf, A.: The second international nurse rostering competition. In: Proceedings of the 10th International Conference of the Practice and Theory of Automated Timetabling (PATAT-2014), pp. 554–556 (2014)

Cheang, B., Li, H., Lim, A., Rodrigues, B.: Nurse rostering problems—a bibliographic survey. Eur. J. Oper. Res. 151(3), 447–460 (2003)

Desaulniers, G., Desrosiers, J., Solomon, M.M.: Column Generation, vol. 5. Springer, Berlin (2006)

Dumas, Y., Soumis, F., Desrosiers, J.: Optimizing the schedule for a fixed vehicle path with convex inconvenience costs. Transp. Sci. 24(2), 145–152 (1990). https://doi.org/10.1287/trsc.24.2.145

Frigge, M., Hoaglin, D.C., Iglewicz, B.: Some implementations of the boxplot. Am. Stat. 43(1), 50–54 (1989)

Gamache, M., Soumis, F.: A method for optimally solving the rostering problem. In: Yu, G. (ed.) Operations Research in the Airline Industry, International Series in Operations Research and Management Science, Chapter 5, vol. 9, pp. 124–157. Springer, New York (1998)

Gamache, M., Soumis, F., Marquis, G., Desrosiers, J.: A column generation approach for large-scale aircrew rostering problems. Oper. Res. 47(2), 247–263 (1999)

Garcia, R.: Resource constrained shortest paths and extensions. Ph.D. Thesis, Georgia Institute of Technology, GA, USA (2009)

Gérard, M., Clautiaux, F., Sadykov, R.: Column generation based approaches for a tour scheduling problem with a multi-skill heterogeneous workforce. Eur. J. Oper. Res. 252(3), 1019–1030 (2016). https://doi.org/10.1016/j.ejor.2016.01.036

Gomes, R.A., Toffolo, T.A., Santos, H.G.: Variable neighborhood search accelerated column generation for the nurse rostering problem. Electron. Notes Discret. Math. 58, 31–38 (2017). https://doi.org/10.1016/j.endm.2017.03.005 . 4th International Conference on Variable Neighborhood Search

Haspeslagh, S., De Causmaecker, P., Schaerf, A., Stølevik, M.: The first international nurse rostering competition 2010. Ann. Oper. Res. 218(1), 221–236 (2014). https://doi.org/10.1007/s10479-012-1062-0

He, F., Qu, R.: A constraint programming based column generation approach to nurse rostering problems. Comput. Oper. Res. 39(12), 3331–3343 (2012). https://doi.org/10.1016/j.cor.2012.04.018

Irnich, S., Desaulniers, G.: Shortest path problems with resource constraints. In: Desaulniers, G., Desrosiers, J., Solomon, M.M. (eds.) Column Generation, Chapter 2, pp. 33–65. Springer, Boston (2005)

Jaumard, B., Semet, F., Vovor, T.: A generalized linear programming model for nurse scheduling. Eur. J. Oper. Res. 107(1), 1–18 (1998). https://doi.org/10.1016/S0377-2217(97)00330-5

Kohl, N., Karisch, S.E.: Airline crew rostering: problem types, modeling, and optimization. Ann. Oper. Res. 127(1–4), 223–257 (2004)

Legrain, A., Rosat, S., Omer, J.: legraina/nursescheduler: static rostering (2019). https://doi.org/10.5281/zenodo.3460634

Maenhout, B., Vanhoucke, M.: Branching strategies in a branch-and-price approach for a multiple objective nurse scheduling problem. J. Sched. 13(1), 77–93 (2010). https://doi.org/10.1007/s10951-009-0108-x

Pisinger, D., Ropke, S.: Large neighborhood search. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics, pp. 399–419. Springer, Boston (2010). https://doi.org/10.1007/978-1-4419-1665-5_13 . Chapter 13

Prescott-Gagnon, E., Desaulniers, G., Rousseau, L.M.: A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows. Networks 54(4), 190–204 (2009). https://doi.org/10.1002/net.20332

Qurashi, A.G., Taniguchi, E., Yamada, T.: Column generation-based heuristics for vehicle routing problem with soft time windows. J. East. Asia Soc. Trans. Stud. 8, 827–841 (2010)

Qurashi, A.G., Taniguchi, E., Yamada, T.: Exact solution for vehicle routing problem with soft time windows and dynamic travel time. Asian Trans. Stud. 2(1), 48–63 (2012)

Richalet, J., Rault, A., Testud, J., Papon, J.: Model predictive heuristic control: applications to industrial processes. Automatica 14(5), 413–428 (1978). https://doi.org/10.1016/0005-1098(78)90001-8

Saddoune, M., Desaulniers, G., Soumis, F.: Aircrew pairings with possible repetitions of the same flight number. Comput. Oper. Res. 40(3), 805–814 (2013). https://doi.org/10.1287/opre.47.2.247

Sadykov, R., Vanderbeck, F., Pessoa, A., Tahiri, I., Uchoa, E.: Primal Heuristics for Branch-and-Price: the assets of diving methods. INFORMS J. Comput. 31, 251–267 (2018)

Santos, H.G., Toffolo, T.A., Gomes, R.A., Ribas, S.: Integer programming techniques for the nurse rostering problem. Ann. Oper. Res. 239(1), 225–251 (2016)

Wickert, T.I., Santori, C.S., Buriol, L.S.: A fix-and-optimize VNS algorithm applied to the nurse rostering problem. In: Proceedings of the Sixth International Workshop on Model-based Metaheuristic (Matheuristics-2016), pp. 1–12 (2016)