This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An AI-Based Break-Scheduling System for Supervisory Personnel
March/April 2010 (vol. 25 no. 2)
pp. 60-73
Andreas Beer, Graz University of Technology
Johannes Gärtner, Vienna University of Technology
Nysret Musliu, Vienna University of Technology
Werner Schafhauser, Vienna University of Technology
Wolfgang Slany, Graz University of Technology

This break-scheduling system, which is included in Operating Hours Assistant 3.6, helps professional planners create high-quality shift plans, while satisfying labor rules and staffing requirements.

1. N. Musliu, A. Schaerf, and W. Slany, "Local Search for Shift Design," European J. Operational Research, vol. 153, no. 1, 2004, pp. 51–64.
2. S. Minton et al., "Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems," Artificial Intelligence, vol. 58, nos. 1–3, 1992, pp. 161–205.
3. F. Glover and M. Laguna, Tabu Search, Kluwer Academic Publishers, 1997.
4. S. Kirkpatrick, C.D. Gelatt Jr., and M.P. Vecchi, "Optimization by Simulated Annealing," Science, vol. 220, no. 4598, 1983, pp. 671–680.
5. R. Dechter, I. Meiri, and J. Pearl, "Temporal Constraint Networks," Artificial Intelligence, vol. 49, nos. 1–3, 1991, pp. 61–95.
6. C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice Hall, 1982.
7. B. Selman, H. Kautz, and B. Cohen, "Local Search Strategies for Satisfiability Testing," Proc. 2nd DIMACS Implementation Challenge Cliques, Coloring, and Satisfiability, Am. Mathematical Soc., 1993, pp. 521–532.
1. P. Tellier and G. White, "Generating Personnel Schedules in an Industrial Setting Using a Tabu Search Algorithm," Proc. 6th Int'l Conf. Practice and Theory of Automated Timetabling (PATAT 06), LNCS 3867, Springer, 2006, pp. 293–302.
2. T. Aykin, "Optimal Shift Scheduling with Multiple Break Windows," Management Science, vol. 42, no. 4, 1996, pp. 591–602.
3. T. Aykin, "A Comparative Evaluation of Modeling Approaches to the Labor Shift Scheduling Problem," European J. Operational Research, vol. 125, no. 2, 2000, pp. 381–397.
4. S.E. Bechtold and L.E. Jacobs, "Implicit Modeling of Flexible Break Assignments in Optimal Shift Scheduling," Management Science, vol. 36, no. 11, 1990, pp. 1339–1351.
5. M. Rekik, J.-F. Cordeau, and F. Soumis, "Implicit Shift Scheduling with Multiple Breaks and Work Stretch Duration Restrictions," J. Scheduling, vol. 13, no. 1, 2010, pp. 49–75.

Index Terms:
artificial intelligence, break-scheduling system, supervisory personnel, metaheuristic optimization, minimum-conflicts heuristic, constraint satisfaction, Operating Hours Assistant 3.6, Ximes, human-centered computing
Citation:
Andreas Beer, Johannes Gärtner, Nysret Musliu, Werner Schafhauser, Wolfgang Slany, "An AI-Based Break-Scheduling System for Supervisory Personnel," IEEE Intelligent Systems, vol. 25, no. 2, pp. 60-73, March-April 2010, doi:10.1109/MIS.2010.40
Usage of this product signifies your acceptance of the Terms of Use.