Capability of the Maximax&Maximin selection operator in the evolutionary algorithm for a nurse scheduling problem
暂无分享,去创建一个
[1] Asoke Kumar Bhunia,et al. Elitist genetic algorithm for assignment problem with imprecise goal , 2007, Eur. J. Oper. Res..
[2] J. Bard,et al. Short-Term Nurse Scheduling in Response to Daily Fluctuations in Supply and Demand , 2005, Health care management science.
[3] Uwe Aickelin,et al. An Indirect Genetic Algorithm for a Nurse Scheduling Problem , 2004, Comput. Oper. Res..
[4] Peter I. Cowling,et al. A Memetic Approach to the Nurse Rostering Problem , 2001, Applied Intelligence.
[5] Jim Keogh,et al. Nurse Management Demystified , 2006 .
[6] X. Cai,et al. A genetic algorithm for scheduling staff of mixed skills under multi-criteria , 2000, Eur. J. Oper. Res..
[7] Razamin Ramli,et al. Enhancements of evolutionary algorithm for the complex requirements of a nurse scheduling problem , 2014 .
[8] Uwe Aickelin,et al. Exploiting Problem Structure in a Genetic Algorithm Approach to a Nurse Rostering Problem , 2000, ArXiv.
[9] Sabah U. Randhawa,et al. A heuristic-based computerized nurse scheduling system , 1993, Comput. Oper. Res..
[10] Andreas T. Ernst,et al. Staff scheduling and rostering: A review of applications, methods and models , 2004, Eur. J. Oper. Res..
[11] Graham Kendall,et al. Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems , 2006, Eur. J. Oper. Res..