[1]
|
M. Abdelgalil, Z. Yahia and A. B. Eltawil, A proposed new dynamic programming formulation for the nurse rostering problem, in Proceedings of 47th International Conference on Computers and Industrial Engineering, 2017, 1–8.
|
[2]
|
H. Akita and A. Ikegami, A network representation of feasible solution space for a subproblem of nurse scheduling, Proceedings of the Institute of Statistical Mathematics, 61 (2013), 79-95.
|
[3]
|
G. Alpan, R. Larbi and B. Penz, A bounded dynamic programming approach to schedule operations in a cross docking platform, Computers and Industrial Engineering, 60 (2011), 385-396.
doi: 10.1016/j.cie.2010.08.012.
|
[4]
|
M. A. Awadallah, M. A. Al-Betar, A. T. Khader, A. L. Bolaji and M. Alkoffash, Hybridization of harmony search with hill climbing for highly constrained nurse rostering problem, Neural Computing and Applications, 28 (2017), 463-482.
doi: 10.1007/s00521-015-2076-8.
|
[5]
|
J. Bautista and J. Pereira, A dynamic programming based heuristic for the assembly line balancing problem, European Journal of Operational Research, 194 (2009), 787-794.
doi: 10.1016/j.ejor.2008.01.016.
|
[6]
|
F. Bellanti, G. Carello, F. Della Croce and R. Tadei, A greedy-based neighborhood search approach to a nurse rostering problem, European Journal of Operational Research, 153 (2004), 28-40.
doi: 10.1016/S0377-2217(03)00096-1.
|
[7]
|
S. Bouajaja and N. Dridi, A survey on human resource allocation problem and its applications, Operational Research, 17 (2017), 339-369.
doi: 10.1007/s12351-016-0247-8.
|
[8]
|
J. D. Bunton, A. T. Ernst and M. Krishnamoorthy, An integer programming based ant colony optimisation method for nurse rostering, Proceedings of the 2017 Federated Conference on Computer Science and Information Systems, 11 (2017), 407-414.
doi: 10.15439/2017F237.
|
[9]
|
E. Burke, P. De Causmaecker, S. Petrovic and G. V. Berghe, Variable neighborhood search for nurse rostering problems, in Metaheuristics: Computer Decision-Making, Springer, Boston, MA, 2003,153–172.
doi: 10.1007/978-1-4757-4137-7_7.
|
[10]
|
E. K. Burke, T. Curtois, G. Post, R. Qu and B. Veltman, A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem, European Journal of Operational Research, 188 (2008), 330-341.
doi: 10.1016/j.ejor.2007.04.030.
|
[11]
|
E. K. Burke and T. Curtois, New approaches to nurse rostering benchmark instances, European Journal of Operational Research, 237 (2014), 71-81.
doi: 10.1016/j.ejor.2014.01.039.
|
[12]
|
E. K. Burke, J. Li and R. Qu, A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems, European Journal of Operational Research, 203 (2010), 484-493.
doi: 10.1016/j.ejor.2009.07.036.
|
[13]
|
E. K. Burke, T. Curtois, L. F. van Draat, J. Van Ommeren and G. Post, Progress control in iterated local search for nurse rostering, Journal of the Operational Research Society, 62 (2011), 360-367.
doi: 10.1057/jors.2010.86.
|
[14]
|
S. Ceschia, N. Dang, P. De Causmaecker, S. Haspeslagh and A. Schaerf, Second international nurse rostering competition, Annals of Operations Research, 274 (2019), 171–186, arXiv: 1501.04177.
doi: 10.1007/s10479-018-2816-0.
|
[15]
|
T. Curtois and R. Qu, Technical Report: Computational Results on New Staff Scheduling Benchmark Instances, ASAP Research Group, School of Computer Science, University of Nottingham, UK, 2014.
|
[16]
|
F. Della Croce and F. Salassa, A variable neighborhood search based matheuristic for nurse rostering problems, Annals of Operations Research, 218 (2014), 185-199.
doi: 10.1007/s10479-012-1235-x.
|
[17]
|
J. Van den Bergh, J. Beliën, P. De Bruecker, E. Demeulemeester and L. De Boeck, Personnel scheduling: A literature review, European Journal of Operational Research, 226 (2013), 367-385.
doi: 10.1016/j.ejor.2012.11.029.
|
[18]
|
S. C. Gao and C. W. Lin, Particle swarm optimization based nurses' shift scheduling, in Proceedings of the Institute of Industrial Engineers Asian Conference 2013, 2013,775–782.
doi: 10.1007/978-981-4451-98-7_93.
|
[19]
|
R. A. M. Gomes, T. A. M. Toffolo and H. G. Santos, Variable neighborhood search accelerated column generation for the nurse rostering problem, Electronic Notes in Discrete Mathematics, 58 (2017), 31-38.
doi: 10.1016/j.endm.2017.03.005.
|
[20]
|
M. Hadwan, M. Ayob, N. R. Sabar and R. Qu, A harmony search algorithm for nurse rostering problems, Information Sciences, 233 (2013), 126-140.
doi: 10.1016/j.ins.2012.12.025.
|
[21]
|
S. Haspeslagh, P. De Causmaecker, A. Schaerf and M. Stølevik, The first international nurse rostering competition 2010, Annals of Operations Research, 218 (2014), 221-236.
doi: 10.1007/s10479-012-1062-0.
|
[22]
|
F. Knust and L. Xie, Simulated annealing approach to nurse rostering benchmark and real-world instances, Annals of Operations Research, 272 (2019), 187-216.
doi: 10.1007/s10479-017-2546-8.
|
[23]
|
Z. Lü and J.-K. Hao, Adaptive neighborhood search for nurse rostering, European Journal of Operational Research, 218 (2012), 865-876.
|
[24]
|
R. M'Hallah and A. Alkhabbaz, Scheduling of nurses: A case study of a Kuwaiti health care unit, Operations Research for Health Care, 2 (2013), 1-19.
doi: 10.1016/j.orhc.2013.03.003.
|
[25]
|
N. Musliu and F. Winter, A hybrid approach for the sudoku problem: Using constraint programming in iterated local search, IEEE Intelligent Systems, 32 (2017), 52-62.
doi: 10.1109/MIS.2017.29.
|
[26]
|
F. Mischek and N. Musliu, Integer programming model extensions for a multi-stage nurse rostering problem, Annals of Operations Research, 275 (2019), 123-143.
doi: 10.1007/s10479-017-2623-z.
|
[27]
|
E. Rahimian, K. Akartunali and J. Levine, A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems, European Journal of Operational Research, 258 (2017), 411-423.
doi: 10.1016/j.ejor.2016.09.030.
|
[28]
|
E. Rahimian, K. Akartunali and J. Levine, A hybrid integer and constraint programming approach to solve nurse rostering problems, Computers and Operations Research, 82 (2017), 83-94.
doi: 10.1016/j.cor.2017.01.016.
|
[29]
|
H. G. Santos, T. A. M. Toffolo, R. A. M. Gomes and S. Ribas, Integer programming techniques for the nurse rostering problem, Annals of Operations Research, 239 (2016), 225-251.
doi: 10.1007/s10479-014-1594-6.
|
[30]
|
A. M. Shahidin, M. S. M. Said, N. H. M. Said and N. I. A. Sazali, Developing optimal nurses work schedule using integer programming, AIP Conference Proceedings, 1870 (2017), 040031.
doi: 10.1063/1.4995863.
|
[31]
|
P. Smet, P. Brucker, P. D. Causmaecker and G. V. Berghe, Polynomially solvable personnel rostering problems, European Journal of Operational Research, 249 (2016), 67-75.
doi: 10.1016/j.ejor.2015.08.025.
|
[32]
|
I. P. Solos, I. X. Tassopoulos and G. N. Beligiannis, A generic two-phase stochastic variable neighborhood approach for effectively solving the nurse rostering problem, Algorithms, 6 (2013), 278-308.
doi: 10.3390/a6020278.
|
[33]
|
I. X. Tassopoulos, I. P. Solos and G. N. Beligiannis, A two-phase adaptive variable neighborhood approach for nurse rostering, Computers and Operations Research, 60 (2015), 150-169.
doi: 10.1016/j.cor.2015.02.009.
|
[34]
|
T.-H. Wu, J.-Y. Yeh and Y.-M. Lee, A particle swarm optimization approach with refinement procedure for nurse rostering problem, Computers and Operations Research, 54 (2015), 52-63.
doi: 10.1016/j.cor.2014.08.016.
|
[35]
|
Z. Zheng and X. Gong, Chemical reaction optimization for nurse rostering problem,, in Frontier and Future Development of Information Technology in Medicine and Education, Springer, Dordrecht, 2014, 3275–3279.
doi: 10.1007/978-94-007-7618-0_422.
|
[36]
|
Z. Zheng, X. Liu and X. Gong, A simple randomized variable neighbourhood search for nurse rostering, Computers and Industrial Engineering, 110 (2017), 165-174.
doi: 10.1016/j.cie.2017.05.027.
|
[37]
|
, Instances & Results – Nurse Rostering Competition, (Accessed: April 25, 2019), https://www.kuleuven-kulak.be/nrpcompetition/instances-results.
|