Modelling and solving employee timetabling problems

Annals of Mathematics and Artificial Intelligence

Volumn 39, Issue 1-2, 2003, Pages 41-59

  Meisels, Amnon ^a   Schaerf, Andrea ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b UNIVERSITY OF UDINE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038421254     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1024460714760     Document Type: Article

References (34)

1. e User Manual (Version 4.0) (IC-Parc, London, UK, July 1998).
2. R.N. Burns and M. Carter, Workforce size and single shift schedules with variable demands, Management Science 31 (1985) 599-607.
3. A. Caprara, F. Focacci, E. Lamma, P. Mello et al., Integrating constraint logic programming and operations research techniques for the crew rostering problem, Software Practice and Experience 28 (1998) 49-76.
4. Y. Caseau, P. Giulio and E. Levenez, A deductive and object-oriented approach to a complex scheduling problem, in: Deductive and Object Oriented Databases, Phoenix, AZ, Lecture Notes in Computer Science, Vol. 760 (Springer, Berlin, 1993) pp. 67-80.
5. B.Y. Choueiry, Abstraction methods for resource allocation, Ph.D. Thesis, EPFL, Lausanne (1994).
6. J. Collins and E. Sisley, Automated assignment and scheduling of service personnel, IEEE Expert 5 (1994) 33-38.
7. R. Dechter, Constraint networks, in: Encyclopedia of Artificial Intelligence, 2nd edn., ed. S.C. Shapiro (Wiley, New York, 1992) pp. 276-285.
8. R. Dechter and P. vanBeek, Constraint tightness and looseness versus local and global consistency, Journal of ACM 44 (1997) 549-566.
9. H. Emmons and R.N. Burns, Off-day scheduling with hierarchical worker categories, Operations Research 39 (1991) 484-495.
10. H. Emmons and D.-S. Fuh, Sizing and scheduling a full-time and part-time workforce with off-day and off-weekend constraints, Annals of Operations Research 70 (1997) 473-492.
11. D. Frost and R. Dechter, Look-ahead value ordering for constraint satisfaction problems, in: Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI-95) (Morgan Kaufmann, San Mateo, CA, 1995) pp. 572-578.
12. M. Gendreau, A. Hertz and G. Laporte, Tabu search heuristic for the vehicle routing problem, Management Science 40 (1994) 1276-1290.
13. F. Glover, M. Parker and J. Ryan, Coloring by tabu branch and bound, in: Cliques, Coloring, and Satisfiability, Second DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 26, eds. D.S. Johnson and M.A. Trick (American Mathematical Society, 1996).
14. F. Glover and M. Laguna, Tabu Search (Kluwer Academic, Dordrecht, 1997).
15. L. Kragelund, Solving a timetabling problem using hybrid genetic algorithms, Software - Practice and Experience 27 (1997) 1121-1134.
16. A. Meisels, E. Gudes and G. Solotorevsky, Employee timetabling, constraint networks and knowledge-based rules: A mixed approach, in: Proceedings of IPCTAT95, Edinburgh, UK, Lecture Notes in Computer Science, Vol. 1153 (Springer, Berlin, 1996) pp. 93-105.
17. A. Meisels, E. Gudes and G. Solotorevsky, Combining rules and constraints for employee timetabling, International Journal on Intelligence Systems 12 (1997) 419-439.
18. A. Meisels and N. Liusternik, Experiments on networks of employee timetabling problems, in: Practice and Theory of Automated Timetabling II, Toronto, Canada, August, Lecture Notes in Computer Science, Vol. 1408 (Springer, Berlin, 1997) pp. 130-141.
19. S. Minton, M.D. Johnston, A.B. Philips and P. Laird, Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems, Artificial Intelligence 58 (1992) 161-205.
20. E.M. Morgado and J.P. Martins, An AI based approach to crew scheduling, in: Proceedings of the 8th Conference on Artificial Intelligence Applications (1993) pp. 71-77.
21. P. Morris, The breakout method for escaping from local minima, in: Proceedings of the 11th National Conference on Artificial Intelligence (AAAI-93) (AAAI Press/MIT Press, 1993) pp. 40-45.
22. R. Narasimhan, An algorithm for single shift scheduling of hierarchical workforce, European Journal of Operational Research 96 (1996) 113-121.
23. P. Prosser, Hybrid algorithms for the constraint satisfaction problem, Computational Intelligence 9 (1993) 268-299.
24. P. Prosser, Binary constraint satisfaction problems: some are harder than others, in: Proceedings of the 11th European Conference on Artificial Intelligence (Amsterdam, 1994) pp. 95-99.
25. A. Schaerf, Combining local search and look-ahead for scheduling and constraint satisfaction problems, in: Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI-97), Nagoya, Japan (Morgan-Kaufmann, San Mateo, CA, 1997) pp. 1254-1259.
26. A. Schaerf, Local search techniques for large high-school timetabling problems, IEEE Transactions on Systems, Man, and Cybernetics 29(4) (1999) 368-377.
27. A. Schaerf, M. Cadoli and M. Lenzerini, LOCAL++: A C++ framework for local search algorithms, Software - Practice and Experience 30(3) (2000) 233-257.
28. A. Schaerf and A. Meisels, Solving employee timetabling problems by generalized local search, in: Proceedings of the 6th Italian Conference on Artificial Intelligence (AIIA-99), Lecture Notes in Computer Science, Vol. 1792 (Springer, Berlin, 1999) pp. 493-502.
29. B. Selman, H. Levesque and D. Mitchell, A new method for solving hard satisfiability problems, in: Proceedings of the 10th National Conference on Artificial Intelligence, San Jose, CA (1992) pp. 440-446.
30. G. Solotorevsky, E. Shimony and A. Meisels, Csps with counters: A likelihood based heuristic, Journal od Experimental & Theoretical Artificial Intelligence 10 (1998) 117-129.
31. E. Tsang, Foundations of Constraint Satisfaction (Academic Press, New York, 1993).
32. M. Yoshikawa, K. Kaneko, T. Yamanouchi M. Watanabe, A constraint-based high school scheduling system, IEEE Expert 11(1) (1996) 63-72.
33. N. Yugami, Y. Ohta and H. Hara, Improving repair-based constraint satisfaction methods by value propagation, in: Proceedings of the 12th National Conference on Artificial Intelligence (AAAI-94) (1994) pp. 344-349.
34. J. Zhang and H. Zhang, Combining local search and backtracking techniques for constraint satisfaction, in: Proceedings of the 13th National Conference on Artificial Intelligence (AAAI-96), Portland, OR (AAAI Press/MIT Press, 1996) pp. 369-374.