Automated Shift Design and Break Scheduling
Shift design and break scheduling are important employee scheduling problems that arise in many contexts, especially at airports, call centers, and service industries. The aim is to find a minimum number of legal shifts, the number of workers assigned to them, and a suitable number of breaks so that the deviation from predetermined workforce requirements is minimized. Such problems have been extensively investigated in Operations Research and recently have been also tackled with Artificial Intelligence techniques. In this chapter we outline major characteristics of these problems and provide a literature survey over solution techniques to solve them. We then describe in detail two state-of-the-art approaches based on local search techniques. Finally, we discuss our experiences with the application of one of these techniques in a real life case study.
KeywordsSchedule Problem Local Search Time Slot Tabu Search Memetic Algorithm
Unable to display preview. Download preview PDF.
- 4.Beer, A., Gaertner, J., Musliu, N., Schafhauser, W., Slany, W.: Scheduling breaks in shift plans for call centers. In: Proceedings of the 7th International Conference on the Practice and Theory of Automated Timetabling, Montreal, Canada (2008)Google Scholar
- 13.Gärtner, J., Musliu, N., Slany, W.: A heuristic based system for generation of shifts with breaks. In: Proceedings of the 24th SGAI International Conference on Innovative Techniques and Applications of Artificial Intelligence, Cambridge (2004)Google Scholar
- 17.Hoos, H.H., Stützle, T.: Stochastic Local Search: Foundations & Applications. Elsevier / Morgan Kaufmann (2004)Google Scholar
- 20.Musliu, N., Schafhauser, W., Widl, M.: A memetic algorithm for a break scheduling problem. In: 8th Metaheuristic International Conference, Hamburg, Germany (2009)Google Scholar
- 21.Musliu, N.: Intelligent Search Methods for Workforce Scheduling: New Ideas and Practical Applications. PhD thesis, Vienna University of Technology (2001)Google Scholar
- 23.Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Prentice Hall (1982)Google Scholar
- 26.Schafhauser, W.: TEMPLE - A Domain Specific Language for Modeling and Solving Real-Life Staff Scheduling Problems. PhD thesis, Vienna University of Technology (2010)Google Scholar
- 27.Selman, B., Kautz, H.A., Cohen, B.: Local search strategies for satisfiability testing. In: Proceedings of the Second DIMACS Challange on Cliques, Coloring, and Satisfiability (1993)Google Scholar
- 28.Tellier, P., White, G.: Generating personnel schedules in an industrial setting using a tabu search algorithm. In: Burke, E.K., Rudova, H. (eds.) The 5th International Conference on the Practice and Theory of Automated Timetabling, pp. 293–302 (2006)Google Scholar
- 30.Widl, M.: Memetic algorithms for break scheduling. Master’s thesis, Vienna University of Technology, Vienna, Austria (2010), http://www.kr.tuwien.ac.at/staff/widl/thesis.pdf