Distribution requirements and compactness constraints in school timetabling

European Journal of Operational Research

Volumn 102, Issue 1, 1997, Pages 193-214

  Drexl, Andreas ^a   Salewski, Frank ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

Compactness constraints; Distribution requirements; Genetic algorithms; Greedy randomized algorithms; Mode identity; Multiple modes; Partially renewable resources; Timetabling

Indexed keywords

COMPUTATIONAL METHODS; CONSTRAINT THEORY; GENETIC ALGORITHMS; OPTIMIZATION; PROBLEM SOLVING; RANDOM PROCESSES; RESOURCE ALLOCATION; SCHEDULING; STATISTICAL METHODS;

GREEDY RANDOMIZED ALGORITHMS; PARTIALLY RENEWABLE RESOURCES; SCHOOL TIMETABLING;

OPERATIONS RESEARCH;

EID: 0031246797     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(96)00209-3     Document Type: Article

References (44)

1. Abramson, D. (1991), "Constructing school timetables using simulated annealing: Sequential and parallel algorithms", Management Science 37, 98-113.
2. Alvarez-Valdes, R., Martin, G., and Tamarit, J.M. (1994), "Constructing good solutions for a school timetabling problem", Working Paper, University of Valencia, Spain.
3. Aubin, J., and Ferland, J.A. (1989), "A large scale timetabling problem", Computers and Operations Research 16, 67-77.
4. Balakrishnan, N., Lucena, A., and Wong, R.T. (1992), "Scheduling examinations to reduce second order conflicts", Computers and Operations Research 19, 353-361.
5. Böttcher, J., Drexl, A., Kolisch, R., and Salewski, F. (1996), "Project scheduling under partially renewable resource constraints", Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel, No. 398.
6. Cangalovic, M., and Schreuder, J.A.M. (1991), "Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths", European Journal of Operational Research 51, 248-258.
7. Cattrysse, D.C., and Van Wassenhove, L.N. (1992), "A survey of algorithms for the generalized assignment problem", European Journal of Operational Research 60, 260-272.
8. Chahal, N., and de Werra, D. (1989), "An interactive system for constructing timetables on a PC", European Journal of Operational Research 40, 32-37.
9. Colorni, A., Dorigo, M., and Maniezzo, V. (1992), "Genetic algorithms: A new approach to the timetable problem", in: M. Akgül et al. (eds.), Combinatorial Optimization, Springer, Berlin, 235-239.
10. Costa, D. (1994), "A tabu search algorithm for computing an operational timetable", European Journal of Operational Research 76, 98-110.
11. Dinkel, J.J., Mote, J., and Venkataramanan, M.A. (1989), "An efficient decision support system for academic course scheduling", Operations Research 37, 853-864.
12. Domdorf, U., and Pesch, E. (1995), "Evolution based learning in a job shop scheduling environment", Computers and Operations Research 22, 25-40.
13. Dowsland, K.A. (1990), "A timetabling problem in which clashes are inevitable", Journal of the Operational Research Society 41, 907-918.
14. Drexl, A. (1991), "Scheduling of project networks by job assignment", Management Science 37, 1590-1602.
15. Drexl, A., and Haase, K. (1996), "Sequential analysis based randomized regret methods for lotsizing and scheduling", Journal of the Operational Research Society 47, 251-265.
16. Drexl, A., and Salewski, F. (1996), "Distribution requirements and compactness constraints in school timetabling", Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel, No. 383 (Part I: Model), No. 384 (Part II: Methods).
17. Ferland, J.A., and Lavoie, A. (1992), "Exchanges procedures for timetabling problems", Discrete Applied Mathematics 35, 237-253.
18. Ferland, J.A., and Roy, S. (1985), "Timetabling problem for university as assignment of activities to resources", Computers and Operations Research 12, 207-218.
19. de Gans, O.-B. (1981), "A computer timetabling system for secondary schools in the Netherlands", European Journal of Operational Research 7, 175-182.
20. Glover, F. (1989), "Tabu search - Part I", ORSA Journal on Computing 1, 190-206.
21. Goldberg, D.E. (1989), Genetic Algorithms in Search, Optimization, and Machine Learning, Addison Wesley, Reading, MA.
22. Grefenstette, J.J. (1987), "Incorporating problem specific knowledge into genetic algorithms", in: L. Davis (ed.), Genetic Algorithms and Simulated Annealing, Pitman, London, 42-60.
23. Hart, J.P., and Shogan, A.W. (1987), "Semi-greedy heuristics: An empirical study", Operations Research Letters 6, 107-114.
24. Hertz, A., "Tabu search for large scale timetabling problems", European Journal of Operational Research 54, 39-47.
25. Hertz, A. (1992), "Finding a feasible course schedule using tabu search", Discrete Applied Mathematics 35, 255-270.
26. Junginger, W. (1986), "Timetabling in Germany - A survey", Interfaces 16/4, 66-74.
27. Junginger, W. (1993), "On representatives of multi-index transportation problems", European Journal of Operational Research 66, 353-371.
28. Kang, L., and White, G.M. (1992), "A logic approach to the resolution of constraints in timetabling", European Journal of Operational Research 61, 306-317.
29. Kelley, J.E. (1963), "The critical path method: Resources planning and scheduling", in: J.F. Muth and G.L. Thompson (eds.), Industrial Scheduling, Prentice-Hall, Englewood Cliffs, NJ, 347-365.
30. Kitagawa, F., and Ikeda, H. (1988), "An existential problem of a weight controlled subset and its application to school timetable construction", Discrete Mathematics 72, 195-211.
31. Kolisch, R. (1995), Project Scheduling under Resource Constraints - Efficient Heuristics for Several Problem Classes, Physica, Heidelberg.
32. Kolisch, R. (1996), "Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation", European Journal of Operational Research 90, 320-333.
33. Kolisch, R., Sprecher, A., and Drexl, A. (1995), "Characterization and generation of a general class of resource-constrained project scheduling problems", Management Science 41, 1693-1703.
34. Laguna, M., Feo, T.A., and Elrod, H.C. (1994), "A greedy randomized adaptive search procedure for the two-partition problem", Operations Research 42, 677-687.
35. McClure, R.H., and Wells, C.E. (1984), "A mathematical programming model for faculty course assignments", Decision Sciences 15, 409-420.
36. Michalewicz, Z. (1992), Genetic Algorithms + Data Structures = Evolution Programs, Springer, Berlin.
37. Mulvey, J.M. (1982), "A classroom/time assignment model", European Journal of Operational Research 9, 64-70.
38. Pesch, E. (1994), Learning in Automated Manufacturing, Physica, Heidelberg.
39. Salewski, F., and Bartsch, Th. (1994), "A comparison of genetic and greedy randomized algorithms for medium-to-short-term audit-staff scheduling", Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel, No. 356.
40. Salewski, F., and Drexl, A. (1995), "Hierarchical approach to timetabling: models, genetic and semi-greedy algorithms", Paper presented at the INFORMS International Meeting, Singapore, June 1995.
41. Salewski, F., Schirmer, A., and Drexl, A. (1996), "Project scheduling under resource and mode identity constraints", Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel, No. 387 (Part I) and No. 388 (Part II) (1996); to appear in European Journal of Operational Research.
42. Tripathy, A. (1980), "A Lagrangean relaxation approach to course timetabling", Journal of the Operational Research Society 31, 599-603.
43. de Werra, D. (1985), "An introduction to timetabling", European Journal of Operational Research 19, 151-162.
44. Wright, M. (1996), "School timetabling using heuristic search", Journal of the Operational Research Society 47, 347-357.