A column generation approach for the timetabling problem of greek high schools

Journal of the Operational Research Society

Volumn 54, Issue 3, 2003, Pages 230-238

  Papoutsis, K ^a   Valouxis, C ^a   Housos, E ^a  

^a UNIVERSITY OF PATRAS   (Greece)

Author keywords

Integer programming; Linear programming; Optimization; Timetabling

Indexed keywords

INTEGER PROGRAMMING; LINEAR PROGRAMMING; OPTIMIZATION; SCHEDULING;

TIMETABLING;

PROBLEM SOLVING;

EID: 0037354702     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601495     Document Type: Article

References (29)

1. Vance P (1993). Crew scheduling, cutting stock, and column generation: solving huge integer programs. PhD thesis, Georgia Institute of Technology.
2. Fores S, Proll L and Wren A (1998). A column generation approach to bus driver scheduling. In: Bell MEH (ed). Transportation Networks: Recent Methodological Advances. Pergamon Press: Amsterdam, pp 195-208.
3. Anbil R, Forrest JJ and Pulleyblank RW (1998). Column generation and the airline crew pairing problem. Doc Math ICM III: 677-686.
4. Valouxis C and Housos E (2002). Combined bus and driver scheduling. Comput Opns Res 29: 243-259.
5. Werra D (1997). The combinatorics of timetabling. Eur J Op Res 96: 504-513.
6. Birbas T, Daskalaki S and Housos E (1997). Timetabling for Greek high schools. J Op Res Soc 48: 1191-1200.
7. Dimopoulou M and Miliotis P (2001). Implementation of a university course and examination timetabling system. Eu J Op Res 130: 202-213.
8. Tripathy A (1984). School timetabling - a case in large binary integer linear programming. Mngt Sci 30: 1473-1489.
9. Mehta N (1981). The application of a graph coloring method to an examination scheduling problem. Interfaces 11(5): 57-64.
10. Neufeld GA and Tartar J (1974). Graph coloring conditions for the existence of solutions to the timetable problem. Comm ACM 17: 450-453.
11. Carter MW, Laporte G and Lee SY (1996). Examination timetabling: algorithmic strategies and applications. J Op Res Soc 47: 373-383.
12. Carter MW and Johnson DG (2001). Extended clique initialization in examination timetabling. J Op Res Soc 52: 538-544.
13. Rich DC (1996). A smart genetic algorithm for university timetabling, In: Burke E and Ross P (eds). Lecture Notes in Computer Science, Vol. 1153. Springer-Verlag: Berlin, Practice and Theory of Advanced Timetabling, pp 181-197.
14. Erben W and Keppler J (1996). A genetic algorithm solving a weekly course-timetabling problem. In: Burke E and Ross P (eds). Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science, Vol. 1153, Springer-Verlag, Berlin, pp 198-211.
15. Costa D (1994). A tabu search algorithm for computing an operational timetable. Eu J Op Res 76: 98-110.
16. Schaerf A (1996). Tabu search techniques for large high-school timetabling problems. In: Clancey B and Weid D (eds). Proceedings of the 13th National Conference on Artificial Intelligence (AAAI-96), Portland, USA. AAAI Press: Cambridge. MA. pp 363-368.
17. Abramson D (1991). Constructing school timetables using simulating annealing: sequential and parallel algorithms. Mngt Sci 37: 98-113.
18. Johnson D (1990). Timetabling university examinations. J Op Res Soc 41: 39-47.
19. Zervoudakis K and Stamatopoulos P (2001). A generic object-oriented constraint based model for university course timetabling. In: Burke EK and Erban W (eds). The Practice and Theory of Automated Timetabling III, Lecture Notes in Computer Science, Vol. 2079. Springer-Verlag: Berlin, pp 28-47.
20. Stamatopoulos P, Viglas E and Karaboyas S (1998). Nearly optimum timetable construction through CLP and intelligent search. Int J Artif Intell Tools 7: 415-442.
21. Lajos G (1996). Complete university modular timetabling using constraint logic programming. In: Burke E and Ross P (eds). Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science, Vol. 1153. Springer-Verlag: Berlin.
22. Valouxis C and Housos E. Constraint programming approach for school timetabling. Comput Opns Res (To appear).
23. Carter WM and Laporte G (1998). Recent developments in practical course timetabling. In: Burke EK and Carter M (eds). PATAT'97, Lecture Notes in Computer Science, Vol. 1408. Springer-Verlag: Berlin, pp 3-19.
24. Schaerf A (1999). A survey of automated timetabling. Artif Intell Rev 13: 87-127.
25. Barnhart C et al (1998). Branch-and-price: column generation for solving huge integer programs. Opns Res 46: 316-326.
26. Dantzig GB and Wolfe P (1960). Decomposition principle for linear programs. Opns Res 8: 101-111.
27. Wedelin D (1995). An algorithm for large scale 0-1 integer programming with application to airline crew scheduling. Ann Op Res 57: 283-301.
28. Housos E and Elmroth T (1997). Automatic optimization of subproblems in scheduling airline crews. Interfaces 27(5): 68-77.
29. Andersson E, Housos E, Kohl N and Wedelin D (1998). Crew pairing optimization. In: Yu G (ed) Operations Research in the Airline Industry. Kluwer Academic Publishers: Dordrecht, pp 228-258.