Some combinatorial models for course scheduling

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

Volumn 1153, Issue , 1996, Pages 296-308

  de Werra, D ^a  

^a EPFL   (Switzerland)

Author keywords

Chromatic scheduling; Compactness; Graph coloring; Hypergraph; Preassignments; Tabu search; Timetabling

Indexed keywords

GRAPH THEORY; TABU SEARCH; TEACHING;

CHROMATIC SCHEDULING; COMPACTNESS; GRAPH COLORINGS; HYPERGRAPH; PREASSIGNMENTS; TIMETABLING;

SCHEDULING;

EID: 84958772673     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61794-9_67     Document Type: Conference Paper

References (22)

1. C. Berge, Graphes, Gauthier-Villars, Paris (1983)
2. 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
3. D. Costa, A Tabu Search Algorithm for Computing an Operational Timetable, European Journal of Operational Research 76 (1994) 98-110
4. S. Even, A. Itai, A. Shamir, On the complexity of timetable and multicommodity flow problems, SIAM Journal on Computing 5 (1976) 691-703
5. M.R. Garey, D.S. Johnson, Computers and Intractability: a Guide to the Theory of NP-Completeness (’Freeman, New York, 1979)
6. F. Glover, Tabu Search, Part I, ORSA Journal on Computing 1 (1989) I90-206
7. F. Glover, Tabu Search, Part II, ORSA Journal on Computing 2 (1990) 4-32
8. H. Gréflin, Feasible Graph Coloring and a Generalization of Perfect Graphs, IAOR Report 199 (1992) University of Fribourg
9. A. Hertz, V. Robert, Constructing a course schedule by solving a series of assignment type problems, ORWP 94/10, EPFL, November 1994
10. [10] A. Hertz, Tabu Search for Large Scale Timetabling Problems, European Journal of Operational Research (1991) 39-47
11. [11] AJ.W. Hilton, School Timetables, Annals of Discrete Mathematics 11 (1981) 177-188
12. [12] N.V.R. Mahadev, Ph. Solot, D. de Werra, The cyclic compact open-shop scheduling problem, Discrete Mathematics 111 (1993) 361-366
13. [13] D. de Werra, Graphs, Hypergraphs and Timetabling, Methods of Operations Research 49 (1985) 201-213
14. [14] D. de Werra, An introduction to timetabling, European Journal of Operational Research 19 (1985) 151-162
15. [15] D. de Werra, A. Hertz, Tabu Search Techniques: A tutorial and an application to neural networks, OR Spektrum 11 (1989) 131-141
16. [16] 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
17. [17] 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)
18. [18] D. de Werra, N.V.R. Mahadev, Preassignment requirements in chromatic scheduling, ORWP 95/02, EPFL, February 1995 (submitted for publication)
19. [19] D. Abramson, Constructing school timetables using simulated annealing: sequential and parallel algorithms, Management Science 37 (1991) 98-113
20. [20] M.W. Carter, G. Laporte, Recent Developments in Practical Examination Timetabling (in this volume)
21. [21] 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
22. [22] 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