Strong bounds with cut and column generation for class-teacher timetabling

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

Volumn , Issue , 2008, Pages

  Santos, Haroldo Gambini ^a   Uchoa, Eduardo ^a   Ochi, Luiz Satoru ^a   Maculan, Nelson ^a  

^a FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

Column generation; Cut generation; Integer programming; Timetabling

Indexed keywords

INTEGER PROGRAMMING; SCHEDULING;

COLUMN GENERATION; CUT AND COLUMN; CUT GENERATION; INTEGER PROGRAMMING FORMULATIONS; LINEAR RELAXATIONS; LOWER BOUNDS; TIMETABLING; TIMETABLING PROBLEM;

LINEAR PROGRAMMING;

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

References (29)

1. D. Abramson. Constructing school timetables using simulated annealing: sequential and parallel algorithms. Management Science, 37:98–113, 1991.
2. D. Abramson and J. Abela. A parallel genetic algorithm for solving the school timetabling problem. In Proceedings of the 15th Australian Computer Science Conference, 1992.
3. R. Alvarez-Valdés, G. Martin, and M. Tamarit. Constructing good solutions for the spanish school timetabling problem. Journal of the Operational Research Society, 47:1203–1215, 1996.
4. P. Avella and I. Vasil’ev. A computational study of a cutting plane algorithm for university course timetabling. Journal of Scheduling, 8:497–514, 2005.
5. E. Balas. Facets of the knapsack polytope. Mathematical Programming, 1975.
6. C. Barnhart, E. L. Johnson, G. L. Nemhauser, M. W. P. Savelsbergh, and P. H. Vance. Branch-and-price: column generation for solving huge integer programs. Operations Research, 46:316–329, 1998.
7. E.A. Boyd. Fenchel cutting planes for integer programming. Operations Research, 42:53–64, 1992.
8. E.A. Boyd. Solving 0/1 integer programs with enumeration cutting planes. Annals of Operations Research, 50:61–72, 1994.
9. J. Caldeira and C. Agostinho. School timetabling using genetic search. In Practice and Theory of Automated Timetabling, Toronto, 1997.
10. A. Colorni, M. Dorigo, and V. Maniezzo. Metaheuristics for high-school timetabling. Computational Optimization and Applications, 9(3):277–298, 1998.
11. D. Costa. A tabu search algorithm for computing an operational timetable. European Journal of Operational Research, 76:98–110, 1994.
12. G. B. Dantzig and P. Wolfe. Decomposition principle for linear programs. Operations Research, 1960.
13. S. Daskalaki. An integer progamming formulation for a case study in university timetabling. European Journal of Operational Research, 153:117–135, 2004.
14. C. Di Stefano and A. Tettamanzi. An evolutionary algorithm for solving the school timetabling problem. In E. Boers et al., editor, Applications of Evolutionary Computing. EvoWorkshops 2001, pages 452–462, 2001.
15. A. Drexl and F. Salewski. Distribution requirements and compactness constraints in school timetabling. European Journal of Operational Research, 102(1):193–214, October 1997.
16. H. A. Eiselt and G. Laporte. Combinatorial optimization problems with soft and hard requirements. Journal of the Operational Research Society, 38(9):785–795, 1987.
17. S. Even, A. Itai, and A. Shamir. On the complexity of timetable and multicommodity flow problems. SIAM Jounal of Computing, 5(4):691–703, December 1976.
18. C.C. Gotlieb. The construction of class-teacher timetables. In Proceeding IFIP congress 1962, pages 73–77, Amnsterdam, 1963.
19. P.L. Hammer, E.L. Johnson, and U.N. Peled. Facets of regular 0-1 polytopes. Mathematical Programming, 8:179–206, 1975.
20. A. Hertz. Tabu search for large scale timetabling problems. European Journal or Operational Research, 54:39–47, 1991.
21. ILOG S.A. ILOG CPLEX 10.0 User’s Manual, 2006.
22. S.S. Mata. O problema do horário na escola do segundo grau: Modelagem e imple-mentação. Master’s dissertation, Programa de Engenharia de Sistemas e Computação, COPPE, UFRJ, 1989.
23. K. Papoutsis, C. Valouxis, and E. Housos. A column generation approach for the timetabling problem of greek high schools. Journal of the Operational Research Society, 54:230–238, 2003.
24. H. G. Santos, L.S. Ochi, and M.J.F. Souza. A tabu search heuristic with efficient diversification strategies for the class/teacher timetabling problem. Journal of Experimental Algorithmics (JEA), 10, 2005.
25. Haroldo G. Santos, Luiz Satoru Ochi, and E. B. Uchoa. Combining metaheuristics and integer programming on school timetabling problems (abstract). In Proceedings of the 19th International Symposium on Mathematical Programming, 2006.
26. A. Schaerf. Local search techniques for large high school timetabling problems. IEEE Transactions on Systems, Man and Cybernetics Part A:systems and Humans, 29(4):368–377, July 1999.
27. M.J.F. Souza. Programação de Horários em Escolas: Uma Aproximação por Meta-heurísticas. PhD thesis, Programa de Engenharia de Sistemas e Computação, Universidade Federal do Rio de Janeiro - COPPE/UFRJ, Rio de Janeiro, Brasil, 2000.
28. M.J.F. Souza, L.S. Ochi, and N. Maculan. Metaheuristics: Computer Decision-Making, chapter A GRASP-Tabu Search Algorithm for solving School Timetabling Problems, pages 659–672. Kluwer Academic Publishers, 2004.
29. L.A. Wolsey. Faces for a linear inequality in 0-1 variables. Mathematical Programming, 1975.