Abstract
Timetabling problems have often been formulated as coloring problems in graphs. We give formulations in terms of graph coloring (or hypergraph coloring) for a collection of simple class-teacher timetabling problems and review complexity issues for these formulations. This tutorial presentation concludes with some hints on some general procedures which handles many specific requirements.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
C. Berge, Graphes, Gauthier-Villars, Paris (1983)
J. Blazewicz, D. de Werra, Some preemptive open shop scheduling problems with a renewable or a non renewable resource, Discrete Applied Mathematics 35 (1992) 205–219
D. Costa, A Tabu Search Algorithm for Computing an Operational Timetable, European Journal of Operational Research 76 (1994) 98–110
S. Even, A. Itai, A. Shamir, On the complexity of timetable and multicommodity flow problems, SIAM Journal on Computing 5 (1976) 691–703
M.R. Garey, D.S. Johnson, Computers and Intractability: a Guide to the Theory of NP-Completeness (Freeman, New York, 1979)
F. Glover, Tabu Search, Part I, ORSA Journal on Computing 1 (1989) 190–206
F. Glover, Tabu Search, Part II, ORSA Journal on Computing 2 (1990) 4–32
H. Gröflin, Feasible Graph Coloring and a Generalization of Perfect Graphs, IAOR Report 199 (1992) University of Fribourg
A. Hertz, V. Robert, Constructing a course schedule by solving a series of assignment type problems, ORWP 94/10, EPFL, November 1994
A. Hertz, Tabu Search for Large Scale Timetabling Problems, European Journal of Operational Research (1991) 39–47
A.J.W. Hilton, School Timetables, Annals of Discrete Mathematics 11 (1981) 177–188
N.V.R. Mahadev, Ph. Solot, D. de Werra, The cyclic compact open-shop scheduling problem, Discrete Mathematics 111 (1993) 361–366
D. de Werra, Graphs, Hypergraphs and Timetabling, Methods of Operations Research 49 (1985) 201–213
D. de Werra, An introduction to timetabling, European Journal of Operational Research 19 (1985) 151–162
D. de Werra, A. Hertz, Tabu Search Techniques: A tutorial and an application to neural networks, OR Spektrum 11 (1989) 131–141
D. de Werra, N.V.R. Mahadev, U.N. Peled, Edge chromatic scheduling with simultaneity constraints, SIAM Journal on Discrete Mathematics 6 (1993) 631–641
D. de Werra, A.J. Hoffman, N.V.R. Mahadev, U.N. Peled, Restrictions and Preassignments in preemptive open shop scheduling (to appear in Discrete Applied Mathematics)
D. de Werra, N.V.R. Mahadev, Preassignment requirements in chromatic scheduling, ORWP 95/02, EPFL, February 1995 (submitted for publication)
D. Abramson, Constructing school timetables using simulated annealing: sequential and parallel algorithms, Management Science 37 (1991) 98–113
M.W. Carter, G. Laporte, Recent Developments in Practical Examination Timetabling (in this volume)
B. Paechter, A. Cumming, H. Luchian, M. Petriuc, Two Solutions to the General Timetable Problem Using Evolutionary Methods, Proceedings of the IEEE Conference of Evolutionay Computation, 1994
M. Yoshikawa, K. Kaneko, Y. Nomura, M. Watanabe, A constraint-based approach to high-school timetabling problems: a case study, Proceedings of the 12th National Conference on Artificial Intelligence (AAAI-94) 1111–1116
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Werra, D. (1996). Some combinatorial models for course scheduling. In: Burke, E., Ross, P. (eds) Practice and Theory of Automated Timetabling. PATAT 1995. Lecture Notes in Computer Science, vol 1153. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61794-9_67
Download citation
DOI: https://doi.org/10.1007/3-540-61794-9_67
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61794-5
Online ISBN: 978-3-540-70682-3
eBook Packages: Springer Book Archive