Hybrid optimization techniques for the workshift and rest assignment of nursing personnel

Artificial Intelligence in Medicine

Volumn 20, Issue 2, 2000, Pages 155-175

  Valouxis, C ^a   Housos, E ^a  

^a UNIVERSITY OF PATRAS   (Greece)

Author keywords

Hybrid optimization; Integer programming; Local search; Nurse scheduling; Tabu search

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTABILITY AND DECIDABILITY; HEURISTIC METHODS; HOSPITALS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; OPERATIONS RESEARCH; PROBLEM SOLVING; WORK-REST SCHEDULES;

NURSES; TABU SEARCH;

MEDICAL APPLICATIONS;

ALGORITHM; ARTICLE; ARTIFICIAL INTELLIGENCE; HOSPITAL PLANNING; NURSING STAFF; PRIORITY JOURNAL; PROBLEM SOLVING; SYSTEM ANALYSIS; WORK SCHEDULE;

ARTIFICIAL INTELLIGENCE; HUMANS; NURSING STAFF, HOSPITAL; PERSONNEL STAFFING AND SCHEDULING; SOFTWARE; WORKLOAD;

EID: 0034308310     PISSN: 09333657     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0933-3657(00)00062-2     Document Type: Article

References (22)

1. Baker K. Scheduling a full-time workforce to meet cyclic staffing requirements. Manage. Sci. 20:1974;1561-1568.
2. Balakrishnan N., Wong R.T. A network model for the rotating workforce scheduling problem. Networks. 20:1990;25-41.
3. Balas E. An additive algorithm for solving linear programs with zero-one variables. Operations Res. 13:1965;517-545.
4. Berrada I, Ferland J, Michelon P. A multi-objective approach for nurse scheduling. Technical report, Department d'Informatique et de Recherche Operationelle, Universite de Montreal, Montreal, Canada, 1994.
5. Burns R.N. Manpower scheduling with variable demands and alternate weekends off. INFOR. 16:1978;101-111.
6. Burns R.N., Koop G.J. A modular approach to optimal multiple-shift manpower scheduling. Operations Res. 35:1987;100-110.
7. Caprara A, Fischetti M, Toth P. A heuristic method for the set covering problem. In: Cunningham WH, McCormick ST, editors. Proceedings of the Fifth IPCO Conference, Vancouver, Canada, Lecture Notes in Computer Science, vol. 1084. Berlin: Springer, 1996. p. 72-84.
8. Dowsland K.A. Nurse scheduling with tabu search and strategic oscillation. Eur. J. Operational Res. 106:1998;393-407.
9. Gabow H. An efficient implementation of Edmonds algorithm for maximum matching on graphs. J. ACM. 23:1975;221-234.
10. Garey MR, Johnson DS. Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: Freeman, 1979.
11. Glover F. Tabu search - Part I. ORSA J. Comput. 1:1989;190-206.
12. Glover F. Tabu search - Part II. ORSA J. Comput. 2:1990;4-32.
13. Glover F., McMillan C. The general employee scheduling problem: an integration of MS and AI. Comput. Operations Res. 13:1986;563-573.
14. ILOG, ILOG Solver 4.4 Reference Manual, June 1999.
15. Jaumard B., Semet F., Vovor T. A generalized linear programming model for nurse scheduling. Eur. J. Operational Res. 107:1998;1-18.
16. Millar H., Kiragu M. Cyclic and non-cyclic scheduling of 12 h shift nurses by network programming. Eur. J. Operational Res. 104:1998;582-592.
17. Miller H.E., Pierskalla W.P., Rath G.J. Nurse scheduling using mathematical programming. Operations Res. 24:1976;857-871.
18. Narula S.C., Kindorf J.R. Linear 0-1 programming: comparison of implicit enumeration algorithms. Comput. Operations Res. 6:1979;47-51.
19. Ozkarahan I., Bailey J. Goal programming modeling subsystem of a flexible nurse scheduling system. IEEE Trans. 20:1988;306-316.
20. Thompson G.M. A simulated annealing heuristic for shift-scheduling using non-continuously available employees. Comput. Operations Res. 23:1996;275-288.
21. Warner D.M. Scheduling nursing personnel according to nursing preference: a mathematical programming approach. Operations Res. 24:1976;842-856.
22. Wedelin D. An algorithm for large scale 0-1 integer programming with application to airline crew scheduling. Ann. Operation Res. 57:1995;283-301.