Efficient generation of rotating workforce schedules

Discrete Applied Mathematics

Volumn 118, Issue 1-2, 2002, Pages 85-98

  Musliu, Nysret ^a   Gärtner, Johannes ^b   Slany, Wolfgang ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b Ximes Inc   (Austria)

Author keywords

Backtracking; Constraint satisfaction; Search; Workforce scheduling

Indexed keywords

EID: 84867922704     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(01)00258-X     Document Type: Article

References (20)

1. N. Balakrishnan, and R.T. Wong A network model for the rotating workforce scheduling problem Networks 20 1990 25 42
2. BEST, Guidelines for shiftworkers, Bulletin of European Time Studies No. 3, European Foundation for the Improvement of Living and Working Conditions, 1991.
3. B. Butler, Computerized manpower scheduling, Master's Thesis, University of Alberta, Canada, 1978.
4. J. Gärtner, M. Kundi, S. Wahl, K. Hörwein, M. Janke, H. Conrad, I. Carlberg, G. Herber, J. Voß, Handbuch Schichtpläne: Planungstechnik, Entwicklung, Ergonomie, Umfeld. vdf, Hochschulverlag AG an der ETH Zürich, 1998.
5. J. Gärtner, and S. Popkin Influence of law on shift schedule design: USA and Europe, XIV International Symposium on Night and Shiftwork 1999 Wiesensteig Germany
6. F. Glover, and C. McMillan The general employee scheduling problem: an integration of MS and AI Comput. Oper. Res. 13 5 1986 563 573 (Pubitemid 17480190)
7. N. Heller, J. McEwen, W. Stenzel, Computerized scheduling of police manpower, St. Louis Police Department, St. Louis, MO, 1973.
8. R. Hung, A three-day workweek multiple-shift scheduling model, J. Oper. Res. Soc. (44) (1993) 141-146. (Pubitemid 23640097)
9. R. Hung, A multiple-shift workforce scheduling model under 4-day workweek with weekday and weekend labour demands, J. Oper. Res. Soc. (45) (1994) 1088-1092.
10. P. Knauth, Designing better shift systems, Appl. Ergonom. (27) (1996) 39-44. (Pubitemid 26034388)
11. L. Kragelund, T. Kabel, Employee timetabling, Master's Thesis, Department of Computer Science, University of Aarhus, Ny Munkegade, Building 540, DK-8000 Aarhus C, Denmark, 1998.
12. G. Laporte The art and science of designing rotating schedules J. Oper. Res. Soc. 50 1999 1011 1017 (Pubitemid 129596353)
13. G. Laporte, Y. Nobert, and J. Biron Rotating schedules Eur. J. Oper. Res. 4 1980 24 30
14. Hoong Chuin Lau Combinatorial approaches for hard problems in manpower scheduling J. Oper. Res. Soc. Japan 39 1 1996 88 98
15. Hoong Chuin Lau On the complexity of manpower scheduling Comput. Oper. Res. 23 1 1996 93 102
16. N. Musliu, J. Gärtner, W. Slany, Efficient generation of rotating workforce schedules, Technical Report DBAI-TR-2000-35, Institut für Informationssysteme der Technischen Universität Wien, 2000. http://www.arXiv.org/abs/cs.OH/0002018.
17. A. Schaerf, A. Meisels, Solving employee timetabling problems by generalized local search, in: Paper presented at AI*IA'99, Bologna, Italy, 1999.
18. B.M. Smith, S. Bennett, Combining constraint satisfaction and local improvement algorithms to construct anaesthetist's rotas, in: Proc. CAIA-92, 8th IEEE Conf. on Artificial Intelligence Applications, 1992, Monterey, CA, pp. 106-112. (Pubitemid 23562147)
19. J.M. Tien, and A. Kamiyama On manpower scheduling algorithms SIAM Rev. 24 3 1982 275 287
20. G. Weil, K. Heus, Eliminating interchangeable values in the nurse scheduling problem formulated as a constraint satisfaction problem, in: Paper Presented at the Workshop CONSTRAINT'95, Melbourne Beach, Florida, USA, 1995.