A multi criteria meta-heuristic approach to nurse rostering

Proceedings of the 2002 Congress on Evolutionary Computation, CEC 2002

Volumn 2, Issue , 2002, Pages 1197-1202

  Burke, Edmund K ^a   De Causmaecker, Patrick ^b   Petrovic, Sanja ^a   Vanden Berghe, Greet ^b  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

^b ODISEE UNIVERSITY COLLEGE   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

HOSPITALS;

COMPLEX TASK; COST PARAMETERS; EVOLUTIONARY APPROACH; META-HEURISTIC APPROACH; MULTI-CRITERIA; NURSE ROSTERING;

HEURISTIC METHODS;

EID: 84901464731     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2002.1004413     Document Type: Conference Paper

References (22)

1. J. Ahmad, M. Yamamoto, A. Ohuchi: Evolutionary Algorithms for Nurse Scheduling Problem, Proceedings of CEC00, San Diego, 2000, IEEE Press, 196-203
2. U. Aickelin, K. Dowsland: Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem, Journal of Scheduling, Vol. 3, No. 3, 2000, 139-153
3. J. Arthur, A. Ravindran: A Multiple Objective Nurse Scheduling Model, AIIE Transactions, Vol. 13, No. 1, 1981, 55-60
4. I. Berrada, J. Sirland, P. Michelon: A Multi-Objective Approach to Nurse Scheduling with both Hard and Soft Constraints, Socio-Economic Planning Science 30. 1996, 183-193
5. M. J. Brusco, L. W. Jacobs: Cost Analysis of alternative formulations for personnel scheduling in continuously operating organisations, European Journal of Operational Research 86, 1995, 249-261
6. E. K. Burke, Y. Bykov, S. Petrovic: A Multicriteria Approach to Examination Timetabling, E. K. Burke, W. Erben (Eds. ): Practice and Theory of Automated Timetabling, Konstanz, Springer, 2000, 118-131
7. E. K. Burke, P. Cowling, P. De Causmaecker, G. Vanden Berghe: A Memetic Approach to the Nurse Rostering Problem, App. Intell. special issue on Sim. Ev. and Learning, Vol. 15, No. 3,2001, 199-214
8. E. K. Burke, P. Dc Causmaecker, S. Petrovic, G. Vanden Berghe: Fitness Evaluation for Nurse Scheduling Problems, Proceedings of CEC2001, Seoul, 2001, IEEE Press, 1139-1146
9. E. K. Burke, P. De Causmaecker, S. Petrovic, G. Vanden Berghe: Variable Neighbourhood Search for Nurse Rostering Problems, submitted to MIC, 2001
10. E. K. Burke, P. De Causmaecker, G. Vanden Berghe: A Hybrid Tabu Search Algorithm for the Nurse Rostering Problem, X. Yao et al. (Eds. ): SEAL'98, LNCS 1585, 1999, 187-194
11. J.-G. Chen, T. Yeung: Hybrid Expert System Approach to Nurse Scheduling, Computers in Nursing, 1993, 183-192
12. K. Dowsland: Nurse scheduling with Tabu Search and Strategic Oscillation. European Journal of Operations Research (106), 1998, 393-407
13. F. Easton, N. Mansour: A Distributed Genetic Algorithm for Employee Staffing and Scheduling Problems, Conference on Genetic Algorithms, San Mateo, 1993, 360-367
14. L.S. Franz, H.M. Baker, G.K. Leong, T.R. Rakes: Mathematical model for scheduling and staffing multiclinic health regions, European Journal of Operational Research, Vol. 41, No. 3, 1989, 277-289
15. A. Jaszkiewicz: A metaheuristic approach to multiple objective nurse scheduling, Foundations of Computing and Decision Sciences, Vol. 22, No. 3, 1997, 169-184
16. A. Musa, U. Saxena: Scheduling Nurses Using Goal-Programming Techniques, IEEE, 1984, 216-221
17. I. Ozkarahan: An Integrated Nurse Scheduling Model, Journal of the Society for Health Systems, Vol. 3,No. 2, 1991, 79-101
18. B. Paechter, R. C. Rankin, A. Cumming, T. C. Fogarty: Timetabling the Classes of an Entire University with an Evolutionary Algorithm, PPSN V, Springer, LNCS 1498, 1998
19. Petrovic, S., Petrovic R. : Eco-EcoDispatch: DSS for multicriteria loading of thermal power generators, Journal of Decision Systems 4 (4), 1995, 279-295
20. J. Tanomaru: Staff Scheduling by a Genetic Algorithm with Heuristic Operators, Proceedings of CEC95, 1995, 456-461
21. G. Vanden Berghe: Soft constraints in the Nurse Rostering Problem, http://www. cs. nott. ac. uk/-. gvb/constraints. ps, 2001
22. M. Zeleny: A Concept of Compromise Solutions and the Method of the Displaced Ideal, Computers and Oper. Res., Vol. 1, 1974, 479-496