Scheduling breaks in shift plans for call centers

7th International Conference on the Practice and Theory of Automated Timetabling, PATAT 2008

Volumn , Issue , 2008, Pages

  Beer, Andreas ^a   Gärtner, Johannes ^b   Musliu, Nysret ^c   Schafhauser, Werner ^c   Slany, Wolfgang ^a  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b XIMES GmbH   (Austria)

^c VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Break scheduling; Call centers; Min conflicts heuristic; Tabu search

Indexed keywords

COMPUTATION THEORY; CUSTOMER SATISFACTION; LEARNING ALGORITHMS; QUALITY OF SERVICE; SCHEDULING; TABU SEARCH;

CALL CENTERS; COMPUTATIONAL EXPERIMENT; HIGH-QUALITY SOLUTIONS; LOCAL SEARCH; SCHEDULING PROBLEM; SEARCH ALGORITHMS; TABU SEARCH ALGORITHMS; WELL BEING;

PROBLEM SOLVING;

EID: 79960588486     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. Aykin, T. (2000). A comparative evaluation of modeling approaches to the labor shift scheduling problem. European Journal of Operational Research, 125:381–397.
2. Bechtold, S. and Jacobs, L. (1990). Implicit modeling of flexible break assignments in optimal shift scheduling. Management Science, 36(11):1339–1351.
3. Canon, C. (2007). Personnel scheduling in the call center industry. 4OR: A Quarterly Journal of Operations Research, 5(1):89–92.
4. Dantzig, G. (1954). A comment on eddie’s traffic delays at toll booths. Operations Research, 2:339–341.
5. Gärtner, J., Musliu, N., and Slany, W. (2004). A heuristic based system for generation of shifts with breaks. In Proceedings of the Twenty-fourth SGAI International Conference on Innovative Techniques and Applications of Artificial Intelligence (Springer) Cambridge.
6. Gaspero, L. D., Gärtner, J., Musliu, G. K. N., Schaerf, A., and Slany, W. (2007). The minimum shift design problem. Annals of Operations Research, 155:79–105.
7. Glover, F. and Laguna, M. (1997). Tabu search. Kluwer Academic Publishers.
8. Hentenryck, P. V. and Michel, L. (2005). Constraint-Based Local Search. The MIT Press, Massachusetts.
9. Minton, S., Johnston, M. D., Philips, A. B., and Laird, P. (1992). Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence, 58:161–205.
10. Musliu, N., Schaerf, A., and Slany, W. (2004). Local search for shift design. European Journal of Operational Research, 153(1):51–64.
11. Selman, B., Kautz, H. A., and Cohen, B. (1993). Local search strategies for satisfiability testing. In Proceedings of the Second DIMACS Challange on Cliques, Coloring, and Satisfiability.
12. Tellier, P. and White, G. (2006). Generating personnel schedules in an industrial setting using a tabu search algorithm. E. K. Burke, H. Rudov (Eds.): PATAT 2006, pages 293–302.
13. Thompson, G. (1995). Improved implicit modeling of the labor shift scheduling problem. Management Science, 41(4):595–607.