How to decompose constrained course scheduling problems into easier assignment type subproblems

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

Volumn 1153, Issue , 1996, Pages 364-373

  Robert, Vincrent ^a   Hertz, Alain ^a  

^a Ecl Polytech Federale   (Switzerland)

Author keywords

Assignment type problems; Course scheduling; Tabu search

Indexed keywords

TABU SEARCH;

ASSIGNMENT TYPE PROBLEMS; COURSE SCHEDULING; INITIAL SOLUTION; NEW APPROACHES; SECOND PHASE; SUB-PROBLEMS;

SCHEDULING;

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

References (15)

1. Balas, E. and Xue, J., “Minimum weighted coloring of triangulated graphs, with application to maximum weight vertex packing and clique finding in arbitrary graphs”, SIAM J. Comput. 20/2 (1991) 209-221.
2. Carlson, R.C. and Nemhauser, G.L., “Scheduling to minimize interaction cost”, Operations Research 14 (1966) 52-58.
3. Edmonds, J. and Karp, R.M., “Theoretical improvements in algorithmic efficiency for network flow problems”, Journal of the A.C.M. 19/2 (1972) 248-264.
4. Ferland, J.A. and Lavoie, A., “Exchanges procedures for timetabling problems”, Discrete Applied Mathematics 35 (1992) 237-253.
5. Friden, C., Hertz, A. and de Werra D., “TABARIS: an exact algorithm based on tabu search for finding a maximum independent set in a graph”, Computers and Operations Research 17 (1990) 437-445.
6. de Gans, O.B., “A computer timetabling system for secondary schools in the Netherlands”~ European Journal of Operational Research 7 (1981) 175-182.
7. Garey, M.R. and Johnson, D.S., “Computers and Intractibility: a Guide to the Theory of NP-Completeness”, Freeman, New York (1979).
8. Glover, F., “Tabu Search, Part I”, ORSA Journal on Computing 1 (1989) 190-206.
9. Glover, F., “Tabu Search, Part II”, ORSA Journal on Computing 2 (1990) 4-32.
10. Hertz, A. and Robert V., “Constructing a course schedule by solving a series of assignment type problems”, ORWP 94/10, Dept of Maths, EPFL, Switzerland (1994).
11. Mannino, C. and Sassano A., “An exact algorithm for the stable set problem”, IASI-CNR Report No. 334, Rome, Italy (1992).
12. Mulvey, J.M., “A classroom/time assignment model”, European Journal of Operational Research 9 (1982) 64-70.
13. Ross, C.T. and Soland, R.M., “A Branch and Bound Algorithm for the Generalized Assignment Problem”, Mathematical Programming 8 (1975) 91-103.
14. Tripathy, A., “A Lagrangian relaxation approach to course scheduling”, Journal of the Operational Research Society 31 (1980) 599-603.
15. de Werra, D., “An introduction to timetabling”, European Journal of OperationalResearch 19 (1985) 151-162.