An al-based break-scheduling system for supervisory personnel

IEEE Intelligent Systems

Volumn 25, Issue 2, 2010, Pages 60-73

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

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b Ximes ^*  (United Kingdom)

^c VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

HIGH QUALITY; OPERATING HOURS; SCHEDULING SYSTEMS; STAFFING REQUIREMENTS;

MIDDLEWARE; SCHEDULING;

SUPERVISORY PERSONNEL;

EID: 77954813927     PISSN: 15411672     EISSN: None     Source Type: Journal    
DOI: 10.1109/MIS.2010.40     Document Type: Conference Paper

References (7)

1. N. Musliu, A 1. . 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.