Solving employee timetabling problems by generalized local search

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1792, Issue , 2000, Pages 380-389

  Schaerf, Andrea ^a   Meisels, Amnon ^b  

^a UNIVERSITY OF UDINE   (Italy)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; INFORMATION ANALYSIS; LOCAL SEARCH (OPTIMIZATION); SCHEDULING;

COMPLEX CONSTRAINTS; DIFFICULT INSTANCES; EMPLOYEE TIMETABLING; EMPLOYEE TIMETABLING PROBLEMS; LOCAL SEARCH METHOD; LOCAL SEARCH TECHNIQUES; REAL-WORLD PROBLEM; SYSTEMATIC SEARCHES;

PROBLEM SOLVING;

EID: 57649224431     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (13)

1. e User Manual (Version 4.0). IC-Parc, London (UK), 1998.
2. J. Collins and E. Sisley. Automated assignment and scheduling of service personnel. IEEE Expert, 5:33–38, 1994.
3. M. Gendreau, A. Hertz, and G. Laporte. Tabu search heuristic for the vehicle routing problem. Management Science, 40:1276–1290, 1994.
4. F. Glover and M. Laguna. Tabu search. Kluwer Academic Publishers, 1997.
5. F. Glover, M. Parker, and J. Ryan. Coloring by tabu branch and bound. In D. S. Johnson and M. A. Trick, editors, Cliques, Coloring, and Satisfiability. Second DIMACS Implementation Challenge, volume 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, 1996.
6. L. Kragelund. Solving a timetabling problem using hybrid genetic algorithms. Soft. Pract. Exper., 27:1121–34, 1997.
7. A. Meisels, E. Gudes, and G. Solotorevsky. Combining rules and constraints for employee timetabling. Intern. Jou. Intell. Syst., 12:419–439, 1997.
8. 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:161–205, 1992.
9. E. Morgado and J. Martins. An AI based approach to crew scheduling. In Proc. of CAIA-93, pages 71–77, 1993.
10. P. Morris. The breakout method for escaping from local minima. In Proc. of AAAI-93, pages 40–45, 1993.
11. A. Schaerf. Combining local search and look-ahead for scheduling and constraint satisfaction problems. In Proc. of IJCAI-97, pages 1254–1259, 1997. Morgan-Kaufmann.
12. M. Yoshikawa, K. Kaneko, T. Yamanouchi, and M. Watanabe. A constraint-based high school scheduling system. IEEE Expert, 11(1):63–72, 1996.
13. N. Yugami, Y. Ohta, and H. Hara. Improving repair-based constraint satisfaction methods by value propagation. In Proc. of AAAI-94, pages 344–349, 1994.