Abstract
- The creation of a teaching timetable based on the needs of students and teachers is a problem hard to solve. In this paper we introduce the basic operation parameters of the STB application with emphasis to the processing module. The application, as can be deduced from the results of testing in cases having varying degree of complexity, can create the teaching timetable of a typical high school based on all the relevant limitations and constraints that result from our educational system. The processing module operates with random variables and it gives satisfactory results within reasonable processing time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Tripathy, “School Timetabling - A case in large binary integer linear programming”, Discrete Applied Mathematics,vol. 35, 3, pp. 313-323, 1984.
L. Davis, F. Ritter, “Schedule optimization with probabilistic search”, Proc. of the 3rd IEEE Conference on Artificial Intelligence Applications, Orlando, Florida, USA, pp. 231-236, February 1987.
L. Kang, G.M. White, “A logic approach to the resolution of constraints in timetabling”, European Journal of Operational Research, vol. 61, pp. 306-317, 1992.
P. Boizumault, C. Gueret, N. Jussien, “Efficient labelling and constraint relaxation for solving time tabling problems”, Proc. of International Logic Programming Symposium - Workshop on Constraint Languages and their use in Problem Modeling, pp. 116-130, 1994.
E.K. Burke, D.G. Elliman, R.F. Weare, “A university timetabling system based on graph colouring and constraint manipulation”, Journal of Research on Computing in Education, vol. 27, 1, pp. 1-18, 1994.
D.B. Papoulias, “The assignment-to-days problem in a school time-table, a heuristic approach”, European Journal of Operational Research, vol. 1, pp. 31-41, 1980.
M. Dorigo, M. Maniezzo, A. Colorni, “The ant system: optimization by a colony of cooperating agents”, IEEE Transactions on Systems, Man and Cybernetics, vol. 26, pp. 29-41, 1996.
A. Colorni, M. Dorigo, V. Maniezzo, “Genetic algorithms and highly constrained problems; the timetable case”,Proc. 1st Int. Workshop Parallel Problem Solving from Nature I, Springer-Verlag, pp.55-59, 1990.
S.E. Ling, “Integrating genetic algorithms with a prolog assignment problem as a hybrid solution for a Polytechnic timetable problem”, Proc. of Parallel Problem Solving from Nature II, Elsevier Science Publisher, pp. 321-329, 1992.
E.K. Burke, D.G. Elliman, R.F. Weare, “A genetic algorithm based university timetabling system”, Proc. of East-West Conference on Computer Technologies in Education, Crimea, Ukraine, pp.35-40, 1994.
D. Corne, P. Ross, H-L. Fang, “GA Note 7: Fast Practical Evolutionary timetabling”, Technical report, University of Edinburgh, Department of Artificial Intelligence, 1994.
B. Paechter, A. Cumming, H. Luchian, M. Petriuc, “Two solutions to the general timetable problem using evolutionary methods”. Proc. of the First IEEE Conference on Evolutionary Computation, pp. 300-305, 1994.
R. Weare, R. Burke, D. Elliman, “A hybrid genetic algorithm for highly constrained timetabling problems”, Nottingham University, School of Computer Science and Information Technology, Computer Science Technical Report No. NOTTCS-TR-1995-8, 1995.
H. Kanoh, M. Kondo, M. Sugimoto, “Solving timetabling problems using genetics algorithms based on minimizing conflict heuristics”, in K. Giannakoglou, D. Tsahalis, J. Periaux, K. Papailiou and T.C. Fogarty (eds.), Evolutionary Methods for Design, Optimisation and Control, International Center for Numerical Methods in Engineering (CIMNE), Barcelona, Spain, pp. 257-262, 1992.
Microsoft Inc., “How Visual Basic Generates Pseudo-Random Numbers for the RND Function”. Available online from: http://support.microsoft.com/kb/q231847/ [retrieved on March, 20, 2006].
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer
About this paper
Cite this paper
Panagiotakopoulos, C., Kameas, A. (2007). Creation of a teaching timetable using random variables – The STB application. In: Iskander, M. (eds) Innovations in E-learning, Instruction Technology, Assessment, and Engineering Education. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-6262-9_77
Download citation
DOI: https://doi.org/10.1007/978-1-4020-6262-9_77
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-6261-2
Online ISBN: 978-1-4020-6262-9
eBook Packages: EngineeringEngineering (R0)