Nurse scheduling using Harmony Search

Proceedings - 2011 6th International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2011

Volumn , Issue , 2011, Pages 58-63

  Awadallah, Mohammed A ^a   Khader, Ahamad Tajudin ^a   Al Betar, Mohammed Azmi ^a,b   Bolaji, Asaju La'aro ^a  

^a SCHOOL OF PHYSICS   (Malaysia)

^b AL ZAYTOONAH UNIVERSITY OF JORDAN   (Jordan)

Author keywords

Harmony Search; Metaheuristic Algorithms; Nurse scheduling; Population based

Indexed keywords

DATA SETS; HARMONY SEARCH; HARMONY SEARCH ALGORITHMS; META HEURISTIC ALGORITHM; NURSE SCHEDULING; NURSE SCHEDULING PROBLEMS; OPTIMISATIONS; POPULATION-BASED; ROSTERING;

COMPETITION; COMPUTATION THEORY; HEURISTIC METHODS; NURSING; PACKET NETWORKS;

SCHEDULING ALGORITHMS;

EID: 80155179853     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/BIC-TA.2011.75     Document Type: Conference Paper

References (26)

1. E. Burke, P. De Causmaecker, and G. Vanden Berghe, "Novel metaheuristic approaches to nurse rostering problems in Belgian hospitals," Handbook of Scheduling: Algorithms, Models and Performance Analysis, pages, pp. 44-1, 2004.
2. A. Mason and M. Smith, "A nested column generator for solving rostering problems with integer programming," in International conference on optimisation: techniques and applications. Citeseer, 1998, pp. 827-834.
3. B. Maenhout and M. Vanhoucke, "Branching strategies in a branchand-price approach for a multiple objective nurse scheduling problem," Journal of Scheduling, vol. 13, no. 1, pp. 77-93, 2010.
4. M. Azaiez and S. Al Sharif, "A 0-1 goal programming model for nurse scheduling," Computers and Operations Research, vol. 32, no. 3, pp. 491-508, 2005.
5. G. Beddoe and S. Petrovic, "Enhancing case-based reasoning for personnel rostering with selected tabu search concepts," Journal of the Operational Research Society, vol. 58, no. 12, pp. 1586-1598, 2006.
6. G. Beddoe, S. Petrovic, and J. Li, "A hybrid metaheuristic case-based reasoning system for nurse rostering," Journal of Scheduling, vol. 12, no. 2, pp. 99-119, 2009.
7. R. Qu and F. He, "A hybrid constraint programming approach for nurse rostering problems," Applications and Innovations in Intelligent Systems XVI, pp. 211-224, 2009.
8. H. Li, A. Lim, and B. Rodrigues, "A hybrid AI approach for nurse rostering problem," in Proceedings of the 2003 ACM symposium on Applied computing. ACM, 2003, pp. 730-735.
9. W. Gutjahr and M. Rauner, "An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria," Computers & Operations Research, vol. 34, no. 3, pp. 642-666, 2007. (Pubitemid 44332694)
10. X. Cai and K. Li, "A genetic algorithm for scheduling staff of mixed skills under multi-criteria1," European Journal of Operational Research, vol. 125, no. 2, pp. 359-369, 2000.
11. U. Aickelin and K. Dowsland, "An indirect genetic algorithm for a nurse-scheduling problem," Computers & Operations Research, vol. 31, no. 5, pp. 761-778, 2004. (Pubitemid 38135876)
12. C. Tsai and S. Li, "A two-stage modeling with genetic algorithms for the nurse scheduling problem," Expert Systems with Applications, vol. 36, no. 5, pp. 9506-9512, 2009.
13. K. Dowsland, "Nurse scheduling with tabu search and strategic oscillation," European Journal of Operational Research, vol. 106, no. 2-3, pp. 393-407, 1998. (Pubitemid 128399659)
14. E. Burke, P. De Causmaecker, and G. Vanden Berghe, "A hybrid tabu search algorithm for the nurse rostering problem," Simulated Evolution and Learning, pp. 187-194, 1999.
15. E. 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, vol. 188, no. 2, pp. 330-341, 2008.
16. B. Bilgin, P. De Causmaecker, B. Rossie, and G. Berghe, "Local search neighbourhoods to deal with a novel nurse rostering model," in Proceedings of the 7th International Conference on Practice and Theory of Automated Timetabling, Montreal, 2008.
17. E. ozcan, "Memetic algorithms for nurse rostering," Computer and Information Sciences-ISCIS 2005, pp. 482-492, 2005.
18. E. 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, vol. 203, no. 2, pp. 484-493, 2010.
19. Z. Geem, J. Kim, and G. Loganathan, "A new heuristic optimization algorithm: harmony search," Simulation, vol. 76, no. 2, p. 60, 2001.
20. K. Lee, Z. Geem, S. Lee, and K. Bae, "The harmony search heuristic algorithm for discrete structural optimization," Engineering Optimization, vol. 37, no. 7, pp. 663-684, 2005. (Pubitemid 41659247)
21. M. Al-Betar and A. Khader, "A harmony search algorithm for university course timetabling," Annals of Operations Research, pp. 1-29, 2008.
22. -, "A hybrid harmony search for university course timetabling," in Proceedings of the 4nd Multidisciplinary Conference on Scheduling: Theory and Applications (MISTA 2009), Dublin, Ireland, August, pp. 10-12.
23. M. Al-Betar, A. Khader, and F. Nadi, "Selection mechanisms in memory consideration for examination timetabling with harmony search," in Proceedings of the 12th annual conference on Genetic and evolutionary computation. ACM, 2010, pp. 1203-1210.
24. Z. Geem, "Optimal cost design of water distribution networks using harmony search," Engineering Optimization, vol. 38, no. 3, pp. 259-277, 2006.
25. A. Wren, "Scheduling, timetabling and rosteringa special relationship?" Practice and Theory of Automated Timetabling, pp. 46-75, 1996. (Pubitemid 126141959)
26. X. Yang, "Harmony search as a metaheuristic algorithm," Music-inspired harmony search algorithm, pp. 1-14, 2009.