A Generic Two-Phase Stochastic Variable Neighborhood Approach for Effectively Solving the Nurse Rostering Problem
暂无分享,去创建一个
Grigorios N. Beligiannis | Ioannis X. Tassopoulos | Ioannis P. Solos | G. Beligiannis | Ioannis P. Solos
[1] J. M. Thompson,et al. Solving the multi-objective nurse scheduling problem with a weighted cost function , 2007, Ann. Oper. Res..
[2] Mario Vanhoucke,et al. An evolutionary approach for the nurse rerostering problem , 2011, Comput. Oper. Res..
[3] Sanja Petrovic,et al. Hybrid Variable Neighborhood Approaches to Exam Timetabling , 2007 .
[4] Edmund K. Burke,et al. A shift sequence based approach for nurse scheduling and a new benchmark dataset , 2010, J. Heuristics.
[5] Sriyankar Acharyya,et al. Comparative Performance of Simulated Annealing and Genetic Algorithm in Solving Nurse Scheduling Problem , 2008 .
[6] Jin-Kao Hao,et al. Adaptive neighborhood search for nurse rostering , 2012, Eur. J. Oper. Res..
[7] Jeffrey H. Kingston,et al. The Complexity of Timetable Construction Problems , 1995, PATAT.
[8] Sanja Petrovic,et al. Hybrid variable neighbourhood approaches to university exam timetabling , 2010, Eur. J. Oper. Res..
[9] Pierre Hansen,et al. Variable neighbourhood search: methods and applications , 2010, Ann. Oper. Res..
[10] Edmund K. Burke,et al. Novel Metaheuristic Approaches to Nurse Rostering Problems in Belgian Hospitals , 2004, Handbook of Scheduling.
[11] Hendrik Van Landeghem,et al. The State of the Art of Nurse Rostering , 2004, J. Sched..
[12] Fred W. Glover,et al. Neighborhood analysis: a case study on curriculum-based course timetabling , 2011, J. Heuristics.
[13] Volker Nissen,et al. Particle Swarm Optimization and an Agent-Based Algorithm for a Problem of Staff Scheduling , 2010, EvoApplications.
[14] Ender Özcan,et al. Memetic Algorithms for Nurse Rostering , 2005, ISCIS.
[15] Edmund K. Burke,et al. Progress control in iterated local search for nurse rostering , 2011, J. Oper. Res. Soc..
[16] Efthymios Housos,et al. Hybrid optimization techniques for the workshift and rest assignment of nursing personnel , 2000, Artif. Intell. Medicine.
[17] Georges Weil,et al. Constraint programming for nurse scheduling , 1995 .
[18] Walter J. Gutjahr,et al. An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria , 2007, Comput. Oper. Res..
[19] Edmund K. Burke,et al. A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems , 2010, Eur. J. Oper. Res..
[20] Mario Vanhoucke,et al. New Computational Results for the Nurse Scheduling Problem: A Scatter Search Algorithm , 2006, EvoCOP.
[21] Shengxiang Yang,et al. Genetic Algorithms With Guided and Local Search Strategies for University Course Timetabling , 2011, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).
[22] Krzysztof Fleszar,et al. Solving the resource-constrained project scheduling problem by a variable neighbourhood search , 2004, Eur. J. Oper. Res..
[23] Umesh Saxena,et al. Scheduling Nurses Using Goal-Programming Techniques , 1984 .
[24] Edmund K. Burke,et al. SCHEDULING NURSES USING A TABU-SEARCH HYPERHEURISTIC , 2003 .
[25] É. Taillard,et al. Improvements and Comparison of Heuristics for solving the Multisource Weber Problem , 1997 .
[26] Andrew Lim,et al. A hybrid AI approach for nurse rostering problem , 2003, SAC '03.
[27] George M. White,et al. Using tabu search with longer-term memory and relaxation to create examination timetables , 2004, Eur. J. Oper. Res..
[28] Pierre Hansen,et al. Variable Neighborhood Decomposition Search , 1998, J. Heuristics.
[29] Wan Rosmanira Ismail,et al. A Tabu Search approach to the nurse scheduling problem , 2008, 2008 International Symposium on Information Technology.
[30] Alberto Gómez,et al. Medical doctor rostering problem in a hospital emergency department by means of genetic algorithms , 2009, Comput. Ind. Eng..
[31] Roberto Tadei,et al. A greedy-based neighborhood search approach to a nurse rostering problem , 2004, Eur. J. Oper. Res..
[32] Edmund K. Burke,et al. A scatter search methodology for the nurse rostering problem , 2010, J. Oper. Res. Soc..
[33] Alain Hertz,et al. A variable neighborhood search for graph coloring , 2003, Eur. J. Oper. Res..
[34] Graham Kendall,et al. A Hybrid Evolutionary Approach to the Nurse Rostering Problem , 2010, IEEE Transactions on Evolutionary Computation.
[35] Uwe Aickelin,et al. An Indirect Genetic Algorithm for a Nurse Scheduling Problem , 2004, Comput. Oper. Res..
[36] Edmund K. Burke,et al. A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem , 2004, Eur. J. Oper. Res..
[37] E. Burke,et al. Variable neighborhood search for nurse rostering problems , 2004 .
[38] Luca Di Gaspero,et al. Multi-neighbourhood Local Search with Application to Course Timetabling , 2002, PATAT.
[39] Erik Demeulemeester,et al. Personnel scheduling: A literature review , 2013, Eur. J. Oper. Res..
[40] Pierre Hansen,et al. Improvement and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem , 2000, Oper. Res..