ISCIS 2005: Computer and Information Sciences - ISCIS 2005 pp 874-883 | Cite as
An Investigation of the Course-Section Assignment Problem
Abstract
We investigate the problem of enumerating schedules, consisting of course-section assignments, in increasing order of the number of conflicts they contain. We define the problem formally, and then present an algorithm that systematically enumerates solutions for it. The algorithm uses backtracking to perform a depth-first search of the implicit search space defined by the problem, pruning the search space when possible. We derive a mathematical formula for the algorithm’s average-case time complexity using a probabilistic approach, and also give a brief overview of its implementation in a WEB application.
Keywords
Schedule Problem Constraint Satisfaction Problem Timetabling Problem Student Advisor Constraint Logic ProgrammingPreview
Unable to display preview. Download preview PDF.
References
- 1.Schaerf, A.: Tabu search techniques for large high-school timetabling problems. In: Proceedings of the Fourteenth National Conference on Artificial Intelligence, Portland, Oregon, USA, pp. 363–368 (1996)Google Scholar
- 2.Silberchatz, A., Korth, S.: Database System Concepts, 4th edn. McGraw Hill, New York (2002)Google Scholar
- 3.Bayram, Z.: Course scheduling web application (2003), available at, http://cmpe.emu.edu.tr/bayram/VRegistration/form.asp
- 4.Frangouli, H., Harmandas, V., Stamatopoulos, P.: UTSE: Construction of optimum timetables for university courses - A CLP based approach. In: Proceedings of the 3rd International Conference on the Practical Applications of Prolog PAP 1995, Paris, pp. 225–243 (1995)Google Scholar
- 5.Caseau, Y., Guillo, P., Levenez, E.: A deductive and object-oriented approach to a complex scheduling problem. In: Proceedings of Deductive and Object-Oriented Databases: Third International Conference, Phoenix, Arizona, USA, pp. 67–80 (1993)Google Scholar
- 6.Colorni, A., Dorigo, M., Maniezzo, V.: Genetic algorithms - A new approach to the timetable problem. In: Akgul, et al. (eds.) Combinatorial Optimization. Lecture Notes in Computer Science - NATO ASI Series, vol. F 82, pp. 235–239 (1990)Google Scholar
- 7.Elmohamed, M.A.S., Coddington, P., Fox, G.: A comparison of annealing techniques for academic course scheduling. In: Burke, E.K., Carter, M. (eds.) PATAT 1997. LNCS, vol. 1408, pp. 92–114. Springer, Heidelberg (1998)CrossRefGoogle Scholar
- 8.Azevedo, F., Barahona, P.: Timetabling in constraint logic programming. In: Proceedings of the 2nd World Congress on Expert Systems, Lisbon, Portugal (January 1994)Google Scholar
- 9.Blanco, J., Khatib, L.: Course scheduling as a constraint satisfaction problem. In: Proceedings of the Fourth International Conference and Exhibition on The Practical Application of Constraint Technology, London, England (1998)Google Scholar
- 10.Dignum, F.W.N., Janssen, L.: Solving a time tabling problem by constraint satisfaction. Technical report, Eindhoven University of Technology (1995)Google Scholar
- 11.Burke, E.K., Elliman, D.G., Weare, R.F.: A university timetabling system based on graph colouring and constraint manipulation. Journal of Research on Computing in Education 27(1), 1–18 (1994)Google Scholar
- 12.Gaspero, L.D., Schaerf, A.: Tabu search techniques for examination timetabling. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 104–108. Springer, Heidelberg (2001)CrossRefGoogle Scholar