Relaxation of coverage constraints in hospital personnel rostering

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2740, Issue , 2003, Pages 129-147

  De Causmaecker, Patrick ^a   Vanden Berghe, Greet ^a  

^a ODISEE UNIVERSITY COLLEGE   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; HOSPITALS; NURSING; SCHEDULING;

COMPUTATION TIME; COVERAGE CONSTRAINTS; HARD CONSTRAINTS; NURSE ROSTERING; ORIGINAL MODEL; OVER-CONSTRAINED; SEARCH SPACES; SKILLED PERSONNEL;

HUMAN RESOURCE MANAGEMENT;

EID: 35248886738     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45157-0_9     Document Type: Article

References (21)

1. Ahmad, J., Yamamoto, M., Ohuchi, A.: Evolutionary Algorithms for Nurse Scheduling Problem. In: Proc. 2000 Congress Evolut. Comput. (CEC 2000, San Diego, CA) (2000) 196-203
2. Aickelin, U., Dowsland, K.: Exploiting Problem Structure in a Genetic Algorithm Approach to a Nurse Rostering Problem. J. Scheduling 3 (2000) 139-153
3. Berrada, I., Ferland, J., Michelon, P.: A Multi-Objective Approach to Nurse Scheduling with both Hard and Soft Constraints. Socio-Econ. Planning Sci. 30 (1996) 183-193
4. Burke, E.K., Cowling, P., De Causmaecker, P., Vanden Berghe, G.: A Memetic Approach to the Nurse Rostering Problem. Appl. Intell. (special issue on Simulated Evolution and Learning) 15 2001 199-214
5. Burke, E.K., De Causmaecker, P., Petrovic, S., Vanden Berghe, G.: Floating Personnel Requirements in a Shift Based Timetable, Working Paper, KaHo St-Lieven, 2001
6. Burke, E.K., De Causmaecker, P., Petrovic, S., Vanden Berghe, G.: Fitness Evaluation for Nurse Scheduling Problems. Proc. Congress Evolut. Comput. (CEC 2001, Seoul, South Korea) IEEE Press (2001) 1139-1146
7. Burke, E.K., De Causmaecker, P., Petrovic, S., Vanden Berghe, G.: Variable Neighbourhood Search for Nurse Rostering Problems. Proc. 4th Metaheuristics Int. Conf. (MIC 2001, Porto, Portugal) (2001) 755-760 (accepted for publication in the selected papers volume by Kluwer)
8. Burke, E.K., De Causmaecker, P., Vanden Berghe, G.: A Hybrid Tabu Search Algorithm for the Nurse Rostering Problem. In: McKay, B. et al. (Eds.): Simulated Evolution and Learning 1998. Lecture Notes in Artificial Intelligence, Vol. 1585. Springer-Verlag, Berlin Heidelberg New York (1999) 187-194
9. Chen, J.-G., Yeung, T.: Hybrid Expert System Approach to Nurse Scheduling. Comput. Nursing 11 (1993) 183-192
10. Chiarandini, M., Schaerf, A., Tiozzo, F.: Solving Employee Timetabling Problems with Flexible Workload using Tabu Search. In: Burke, E, Ross, P. (Eds.): Practice and Theory of Automated Timetabling I (PATAT 1995, Edinburgh, Aug/Sept, selected papers). Lecture Notes in Computer Science, Vol. 1153. Springer-Verlag, Berlin Heidelberg New York (1996) 298-302
11. Dowsland K.: Nurse scheduling with Tabu Search and Strategic Oscillation. Eur. J. Oper. Res. 106 (1998) 393-407
12. Isken, M., Hancock, W.: A Heuristic Approach to Nurse Scheduling in Hospital Units with Non-Stationary, Urgent Demand, and a Fixed Staff Size. J. Soc. Health Syst. 2 (1990) 24-41
13. Kawanaka, H., Yamamoto, K., Yoshikawa, T., Shinogi, T., Tsuruoka S.: Genetic Algorithm with the Constraints for Nurse Scheduling Problem, Proc. Congress Evolut. Comput. (CEC 2001, Seoul, South Korea) IEEE Press (2001) 1123-1130
14. Meisels, A., Gudes, E., Solotorevski, G.: Employee Timetabling, Constraint Networks and Knowledge-Based Rules: a Mixed Approach. In: Burke, E, Ross, P. (Eds.): Practice and Theory of Automated Timetabling I (PATAT 1995, Edinburgh, Aug/Sept, selected papers). Lecture Notes in Computer Science, Vol. 1153. Springer-Verlag, Berlin Heidelberg New York (1996) 93-105
15. Meyer auf'm Hofe, H.: Solving Rostering Tasks as Constraint Optimization. In: Burke, E, Erben W. (Eds.): Practice and Theory of Automated Timetabling III (PATAT 2000, Konstanz, Germany, August, selected papers). Lecture Notes in Computer Science, Vol. 2079. Springer-Verlag, Berlin Heidelberg New York (2001) 191-212
16. Miller, M.L., Pierskalla, W., Rath, G.: Nurse Scheduling Using Mathematical Programming. Oper. Res. 24 (1976) 857-870
17. Okada, M.: An Approach to the Generalised Nurse Scheduling Problem - Generation of a Declarative Program to Represent Institution-Specific Knowledge. Comput. Biomed. Res. 25 (1992) 417-434
18. Ozkarahan, I.: A Disaggregation Model of a Flexible Nurse Scheduling Support System. Socio-Econ. Planning Sci. 25 (1991) 9-26
19. Vanden Berghe, G.: Soft constraints in the Nurse Rostering Problem. http://www.cs.nott.ac.uk/gvb/constraints.ps (2001)
20. Warner, M.: Scheduling Nursing Personnel According to Nursing Preference: a Mathematical Programming Approach. Oper. Res. 24 (1976) 842-856
21. Warner, M., Prawda, J.: A Mathematical Programming Model for Scheduling Nursing Personnel in a Hospital. Manage. Sci. 19 (1972) 411-422