Advertisement

Computer-aided school and university timetabling: The new wave

  • Victor A. Bardadym
Surveys
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1153)

Abstract

During the last five years a peak of interest has been observed in the problems related to computer-aided timetabling. The most recent works in this area are based on the application of modern information technologies. Here the main directions of modern research and design are reviewed. A classification is proposed for academic timetabling problems, requirements for the timetables, mathematical models, solution methods, data representation, and interface design. Modern problem solution and software design approaches are represented in connection with the theoretical background and world experience of 35 years. The integration of several algorithmic and interactive tools is discussed. Criticisms of timetabling computer support practicability and related myths are also reviewed. Related topics, like sport scheduling and scheduling sport, are represented. Some unsolved matters are outlined.

Keywords

Schedule Problem Integer Linear Programming Quadratic Assignment Problem Graph Node Timetabling Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abramson D. (1991) “Constructing School Timetables using Simulated Annealing”, Management Science, 37, 98–113.Google Scholar
  2. 2.
    Almond M. (1969) “A University Faculty Timetable”, Computer Journal, 12, 215–217.Google Scholar
  3. 3.
    Anisimov B.V. and Vlasov V.P. (1971) “Analysis of Decision Rules Applied to Lessons Timetabling”, Mathematical and Information Problems of Science Prognostication and Management, Kiev, V. Glushkov Inst. for Cybernetics, 113–122 (Russian).Google Scholar
  4. 4.
    Aubin J. and Ferland J.A. (1989) “A Large Scale Timetabling Problem”, Computers and Operational Research, 16, 67–77.Google Scholar
  5. 5.
    Babich V.I. and Raetski V.I. (1991) “Models and Results of Automated Academic Timetabling”, Methods and Systems of Technical Diagnostics, Saratov State University, 99–102 (Russian).Google Scholar
  6. 6.
    Bardadym V.A. and Vasilyeva-Sklyarova T.V. (1994) “A Decision Support System For Computer-Aided School Timetabling”, Proceedings of East-West International Conference on Computer Technologies in Education, Crimea, Ukraine, Part 2, 33–35.Google Scholar
  7. 7.
    Bardadym V.A. (1991a) “Computer-Aided Lessons Timetables Construction. A Survey” USIM (Management Systems and Computers), #8, 119–126 (Russian).Google Scholar
  8. 8.
    Bardadym V.A. (1991b) “The Complexity Estimate for Two Timetable Construction Problems”, in: A.M. Dovgiallo (Ed.), Computer Assisted Learning Techniques, Kiev, Glushkov Institute for Cybernetics, 72–78 (Russian).Google Scholar
  9. 9.
    Barkan S.A. and Tanaev VS. (1970) “About the Construction of Lesson Timetables”, Vesti Akademii Nauk BSSR (Communications of Byelorussian Academy of Sciences), Physical and Mathematical Serie, #1, 76–82 (Russian).Google Scholar
  10. 10.
    Barraclough E.D. (1965) “The Application of a Digital Computer to the Construction of Timetables”, The Computer Journal, 8, 136–146.Google Scholar
  11. 11.
    Belova N.B. and Krasner N.Ya. (1984) “Timetabling Models and Methods”, Models and Methods for Rational Planning in the University, Voronezh State University, 43–55 (Russian).Google Scholar
  12. 12.
    Burke E.K., Elliman D.G. and Weare R.F. (1994) “A Genetic Algorithm Based University Timetabling System”, Proceedings of East-West International Conference on Computer Technologies in Education, Crimea, Ukraine, part 1, 35–39.Google Scholar
  13. 13.
    Carter M.W. and Tovey C.A. (1992) “When is the Classroom Assignment Problem Hard?”, Operations Research, 40, 28–39.Google Scholar
  14. 14.
    Carter M.W. (1989) “A Lagrangian Relaxation Approach to the Classroom Assignment Problem”, INFOR, 27, 230–246.Google Scholar
  15. 15.
    Carter M.W. (1986) “A Survey of Practical Applications of Examination Timetabling Algorithms” Operations Research, 34, 193–202.Google Scholar
  16. 16.
    Chan S.K. and Lam C.Y. (1990) “The Electronic Spreadsheet as a Tool for Course Co-ordination in a School of Engineering”, Computers and Education, 14, 231–238.Google Scholar
  17. 17.
    Chahal N. and de Werra D. (1989) “An Interactive System for Constructing Timetables on a PC”, European Journal of Operational Research, 40, 32–37.Google Scholar
  18. 18.
    Chow K.O., Loo W.S., Kwan C.M., Martinsons M.G. (1991) “An Objectoriented Expert System in Academic Timetabling”, Proc. of National Conference on Information Technology, Malaysia, 1991, 90–96.Google Scholar
  19. 19.
    Cole R. and Hopcroft J. (1982) “On Edge Coloring Bipartite Graphs”, SIAM Journal on Computing, 11, 540–546.Google Scholar
  20. 20.
    De Gans O. (1981), “A Computer Timetabling System for Secondary Schools in the Netherlands”, European Journal of Operational Research, 7, 175–182.Google Scholar
  21. 21.
    De Werra D., Jacot-Descombes L. and Masson P. (1990) “A Constrained Sports Scheduling Problem”, Discrete Applied Mathematics, 26, 41–49.Google Scholar
  22. 22.
    De Werra D. (1985) “An Introduction to Timetabling”, European Journal of Operational Research, 19, 151–162.Google Scholar
  23. 23.
    De Werra D. (1975) “On a Particular Conference Scheduling Problem”, INFOR, 13, 308–315.Google Scholar
  24. 24.
    Dovgiallo A.M., Mehtiev H.B. and Petrushin V.A. (1989) “An Expert System for Curricula Development”, Methods and Systems of Technical Diagnostics, Saratov State University, 98–101 (Russian).Google Scholar
  25. 25.
    Dowsland K.A. (1990) “A Timetabling Problem in which Clashes are inevitable”, Journal of Operations Research, 41, 907–918.Google Scholar
  26. 26.
    Estrada Senti V. (1986) “Structures, Algorithms and Software for University Planning in the Republic of Cuba”, PhD Thesis, Kiev Polytechnical Institute (Russian).Google Scholar
  27. 27.
    Even S., Itai A. and Shamir A. (1975) “On the Complexity of Timetable and Multicommodity Flow Problems”, SIAM Journal of Computing, 5, 691–703.Google Scholar
  28. 28.
    Fahrion R. and Dollanski G. (1992) “Construction of University Faculty Timetables using Logic Programming Techniques”, Discrete Applied Mathematics, 35, 221–236.Google Scholar
  29. 29.
    Fedotov A.V. (1985) “Simulation in University Management”, Leningrad State University (Russian).Google Scholar
  30. 30.
    Ferland J.A. and Lavoie A. (1992) “Exchange Procedures for Timetable Problems”, Discrete Applied Mathematics, 35, 237–253.Google Scholar
  31. 31.
    Ferland J.A. and Fleurent C. (1991a) “SAPHIR: A Decision Support System for Course Scheduling”, Publication #764, Universite de Montreal.Google Scholar
  32. 32.
    Ferland J.A. and Fleurent C. (1991b) “Computer Aided Scheduling for a Sport League”, INFOR, 29, 14–25.Google Scholar
  33. 33.
    Ferraris M., Midoro V. and Olimpo G. (1984) “Petri Nets as a Modelling Tool in the Development of CAL Software”, Computers and Education, 8, 41–49.Google Scholar
  34. 34.
    Garey M. and Johnson D. (1982) “Computers and Intractability”, Moscow, Mir Publ (Russian edition).Google Scholar
  35. 35.
    German E.I., Pak L.V. and Chudinov V.N. (1978) “Lecture Room Distribution in the University”, Automated Management Systems in the University, Novosibirsk State University, 138–142 (Russian).Google Scholar
  36. 36.
    Golumbic M.C., Markovich M., Tsur S. and Schild U.I. (1986) “A Knowledgebased Expert System for Student Advising”, IEEE Transactions on Education, E-29, 120–123.Google Scholar
  37. 37.
    Gosselin K. and Truchon M. (1986) “Allocation of Classrooms by Linear Programming”, Journal of Operations Research, 37, 561–569.Google Scholar
  38. 38.
    Gotlieb C.C. (1962) “The Construction of Class-Teacher Time-Tables”, in Popplewell C.M. (ed.): Information Processing 1962. Proc. IFIP Congress 62, Amsterdam, North-Holland, 73–77.Google Scholar
  39. 39.
    Grigorishin I.A. (1984) “Instrumental Support of Teaching Using Computer Courses”, PhD Thesis, Kiev, V. Glushkov Institute for Cybernetics (Russian).Google Scholar
  40. 40.
    Hertz A. (1992), “Finding a Feasible Course Schedule using Tabu Search”, Discrete Applied Mathematics, 35, 225–270.Google Scholar
  41. 41.
    Hilton A.J.W. (1981) “School Timetables”, Annals of Discrete Mathematics, 11, 177–188.Google Scholar
  42. 42.
    Indushkin V.L., Lysenko V.I. and Tarasov S.B. (1977) “Principles of Automated Management System Design in Higher Education”, Moscow, NIIVSh (Res. Inst. for Higher Education) (Russian).Google Scholar
  43. 43.
    Junginger W. (1986) “Timetabling in Germany — a Survey”, Interfaces, 16(4), 66–74.Google Scholar
  44. 44.
    Kang L., Von Schoenberg G.H. and White G.M. (1991) “Computer University Timetabling Using Logic”, Computers and Education, 17, 145–153.Google Scholar
  45. 45.
    Kirilichev A.M., Kochetkov G.M. and Stepin Yu.P. (1976) “The Principles of Construction of Calendar Planning Subsystem for University Automated Management System”, Design and Implementation of University Automated Management System, Proceedings of Moscow Institute for Oli and Gas Industry, 128, 46–51 (Russian).Google Scholar
  46. 46.
    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.Google Scholar
  47. 47.
    Kostyuk V.I., Martines J.O. and Zorin V.V. (1976) “The Use of Successive Execution Algorithms in Timetabling”, The Problems of Automated University Management System Implementation, Moscow, NIIVSh (Res. Inst. for Higher Education), 3–5 (Russian).Google Scholar
  48. 48.
    Knyazeva T.A. and Portugal V.M. (1969) “Computer-aided University Department Timetable Construction”, Computer-Aided Manufacturing, Kiev, Institute for Cybernetics (Russian).Google Scholar
  49. 49.
    Kowalski K. and Ealy D. (1991) “Schedule Advisement Expert System”, Computers and Education, 17, 259–265.Google Scholar
  50. 50.
    Lazak D. (1968) “Die Beziehungen des Kollisionsindexverfahrens zum GOTLIEB-Verfahren, Die Ableitung eines Kriteriums fur die Existenz von Losungen bei einer Dienstplanmatrix”, Elektronische Datenverarbeitung, 10, 26–37, 58–61.Google Scholar
  51. 51.
    Logvinov I.I. (1980) “Teaching Processes Simulation”, Moscow, Pedagogica Publ (Russian).Google Scholar
  52. 52.
    Loskutov S.I. (1983) “About Educational Timetabling”, Mathematical Methods of Management and Information Processing, Moscow Inst. for Physics and Technology, 151–157 (Russian).Google Scholar
  53. 53.
    Lotfi V. and Sarin S. (1986) “A Graph-Coloring Algorithm for Large-Scale Scheduling Problems”, Computers and Operations Research, 13, 27–32.Google Scholar
  54. 54.
    Lukyanets N.B. (1980) “School Timetable Construction and Editing with the Aid of the Computer”, The Problems of Computer-Aided Management in Education, Moscow, Res. Inst. for Pedagogics, 70–82 (Russian).Google Scholar
  55. 55.
    Mathaisel D.F.X. and Comm C.L. (1991) “Course and Classroom Scheduling — an Interactive Computer-Graphics Approach”, Journal of Systems and Software, 15, 149–157.Google Scholar
  56. 56.
    Mehta N.K. (1981) “The Application of a Graph Coloring Method to an Examination Scheduling Problem”, Interfaces, #11, 57–64.Google Scholar
  57. 57.
    Mulvey J.M. (1982) “A Classroom/Time Assignment Model”, European Journal of Operational Research, 9, 64–70.Google Scholar
  58. 58.
    Neufeld G.A. and Tartar J. (1974) “Graph Coloring Conditions for the Existence of Solutions to the Timetable Problem”, Communications of the ACM, 17, 450–453.Google Scholar
  59. 59.
    Orlov V.N. (1976) “An Analysis of Automated Lessons Timetabling Systems”, Automated Management System and Higher Education, Cheboksary State University, 68–74 (Russian).Google Scholar
  60. 60.
    Ovchinnikov A.A., Puginski A.A. and Petrov G.F. (1972) “The Network Methods for Education Planning and Organisation”, Moscow, Vysshaya Shkola (Russian).Google Scholar
  61. 61.
    Papadimitriou C. and Steiglits K. (1985) “Combinatorial Optimisation”, Moscow, Mir Publ (Russian edition).Google Scholar
  62. 62.
    Potashnik V.Ya. and Pichko S.P. (1977) “A Randomized Scheme for Timetabling in a University”, The Efficiency of Automated Management Systems in Education, Kiev, Znanie Publ., 23–27 (Russian).Google Scholar
  63. 63.
    Romero B.P. (1982) “Examination Scheduling in a Large Engineering School: A Computer-assisted Participative Procedure” Interfaces, 12, #2, 17–24.Google Scholar
  64. 64.
    Samofalov K.G. and Simonenko V.P. (1972) “Automatisation of University Timetabling”, Kiev Polytechnical Institute Publ (Russian).Google Scholar
  65. 65.
    Saveliev A.Ya., Zubarev Yu.B., Kovalenko V.E. and Koloskova T.A. (1984) “Automated Management in University”, Moscow, Radio I Svyaz (Russian).Google Scholar
  66. 66.
    Schmidt G. and Strohlein T. (1980) “Timetable Construction — an Annotated Bibliography”, Computer Journal, 23, 307–316.Google Scholar
  67. 67.
    Schniederjans M.J. and Kim G.C. (1987) “A Goal Programming Model to Optimize Departmental Preference in Course Assignments”, Computers and Operations Research, 14, 87–96.Google Scholar
  68. 68.
    Schreuder J.A.M. (1992) “Combinatorial Aspects of Construction of Competition Dutch Professional Football Leagues”, Discrete Applied Mathematics, 35, 301–312.Google Scholar
  69. 69.
    Sebo A. (1991) “A Particular Timetabling Problem — Terminal Scheduling”, Computers and Mathematics with Applications, 21, 137–156.Google Scholar
  70. 70.
    Selim S.M. (1988) “Split Vertices in Vertex Colouring and Their Application in Developing a Solution to the Faculty Timetable Problem”, Computer Journal, 31, 76–82.Google Scholar
  71. 71.
    Smith W.E. (1984) “Efficiency of a University Timetable — an Application of Entropy of Choice”, Bulletin of the Australian Mathematical Society, 30, 19–26.Google Scholar
  72. 72.
    Tretiak V.A. (1990) “The Design and Implementation of Problem-Oriented Language Tools to Design CAI/CAL Software”, PhD Thesis, Kiev, V. Glushkov Inst. for Cybernetics (Russian).Google Scholar
  73. 73.
    Tripathy A. (1984) “School Timetabling — A Case in Large Binary Integer Linear Programming”, Management Science, 30, 1473–1489.Google Scholar
  74. 74.
    Vishnevskij L.D. (1976) “About a Problem of Calendar Planning”, Kibernetika, #3, 115–118 (Russian).Google Scholar
  75. 75.
    White G.M. and Wong S.K.S. (1988) “Interactive Timetabling in Universities”, Computers and Education, 12, 521–529.Google Scholar
  76. 76.
    Wirth N., (1989) “Algorithms and Data Structures”, Moscow, Mir Publ (Russian edition).Google Scholar
  77. 77.
    Zarubitskaya T.F. and Samoilenko A.T. (1976) “On the Automated Timetabling Subsystem”, Experience of Automated Management System Design and Use in Kiev State University, Moscow, NIIVSh (Research Inst. for Higher Education), 35–40 (Russian).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Victor A. Bardadym
    • 1
  1. 1.International Renaissance FoundationKievUkraine

Personalised recommendations