Abstract
A variety of approaches have been developed by researchers to solve different instances of timetabling problems. In these studies different data formats are used to represent a timetabling problem instance and its solution, causing difficulties in the evaluation and comparison of approaches and sharing of data. In this paper, a model for timetabling problems and a new XML data format for them based on MathML is proposed.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Abramson, D., Dang, H. and Krisnamoorthy, M. (1999) Simulated annealing cooling schedules for the school timetabling problem. Asia-Pacific Journal of Operational Research, 16:1–22.
Alkan, A. and Özcan, E. (2003) Memetic algorithms for timetabling. In Proceedings of 2003 IEEE Congress on Evolutionary Computation, pp. 1796–1802.
Causmaecker, P. D., Demeester, P., Lu, Y. and Vanden, G. (2002) Using web standards for timetabling. In Practice and Theory of Automated Timetabling IV, Lecture Notes in Computer Science, Vol. 2740, Springer, Berlin, pp. 238–258.
Burke, E. K., Eckersley, A. J., McCollum, B., Petrovic S. and Qu, R. (2003) Similarity measures for exam timetabling problems. In Proceedings of the 1st Multidisciplinary International Conference on Scheduling: Theory and Applications, pp. 120–135.
Burke, E. K., Elliman, D. and Weare, R. (1994) A genetic algorithm based timetabling system. In Proceedings of the 2nd East-West International Conference on Computer Technology in Education, pp. 35–40.
Burke, E. K., Newall, J. P., Weare, R. F. (1996) A Memetic Algorithm for University Exam Timetabling. In Practice and Theory of Automated Timetabling I, Lecture Notes in Computer Science, Vol. 1153, Springer, Berlin, pp. 241–250.
Burke, E. K., Pepper P. A. and Kingston, J. H. (1997) A standard data format for timetabling instances. In Practice and Theory of Automated Timetabling II, Lecture Notes in Computer Science, Vol. 1408, Springer, Berlin, pp. 213–222.
Colorni, A., Dorigo, M. and Maniezzo, V. (1992) A genetic algorithm to solve the timetable problem. Technical Report 90-060 revised, Politecnico di Milano, Italy.
Corne, D., Ross, P., Fang, H. L. (1994) Evolutionary timetabling: practice, prospects and work in progress, Proceedings of the UK Planning and Scheduling SIG Workshop.
Cladeira, J. P. and Rosa, A. C. (1997) School timetabling using genetic search. In Practice and Theory of Automated Timetabling I, Lecture Notes in Computer Science, Vol. 1408, Springer, Berlin, pp. 115–122.
Dignum, F. P. M., Nuijten, W. P. M., Janssen, L. M. A. (1995), Solving a Time Tabling Problem by Constraint Satisfaction, Technical Report, Eindhoven University of Technology.
Erben, W. and Keppler, J. (1995), A Genetic algorithm solving a weekly course-timetabling problem. In Practice and Theory of Automated Timetabling I, Lecture Notes in Computer Science, Vol. 1153, Springer, Berlin, pp. 21–32.
Even, S., Itai, A. and Shamir, A. (1976) On the Complexity of Timetable and Multicommodity Flow Problems, SIAM Journal of Computing, 5:691–703.
Fang, H. L. (1994) Genetic algorithms in timetabling and scheduling, Ph.D. Thesis.
Hertz, A. (1992) Finding a feasible course schedule using a tabu search, Discrete Applied Mathematics, 35:255–270.
Kingston, J. H. (2001) Modelling timetabling problems with STTL. In Practice and Theory of Automated Timetabling III, Lecture Notes in Computer Science, Vol. 2079, Springer, Berlin, p. 309.
Leighton, F T. (1979) A graph coloring algorithm for large scheduling problems, Journal of Research of the National Bureau of Standards, 84:489–506.
Monfroglio, A. (1988) Timetabling Through a Deductive Database: A Case Study, Data and Knowledge Engineering, 3:1–27.
Özcan, E. and Alkan, A. (2002) Timetabling using a steady state genetic algorithm. In Practice and Theory of Automated Timetabling II, Lecture Notes in Computer Science, Vol. 1408, Springer, Berlin, pp. 104–107.
Schaerf, A. (1996) Tabu Search Techniques for Large High-School Timetabling Problems, Proceedings of the 14th National Conference on AI, pp. 363–368.
Schmidt, G. and Strohlein, T. (1979) Time table construction—an annotated bibliography, The Computer Journal, 23: 307–316.
De Werra, D. (1985) An introduction to timetabling, European Journal of Operations Research, 19:151–162.
W3C (2004) World Wide Web Consortium web site: http://www.w3c.org.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer Science+Business Media, Inc.
About this paper
Cite this paper
Özcan, E. (2005). Towards an XML-Based Standard for Timetabling Problems: TTML. In: Kendall, G., Burke, E.K., Petrovic, S., Gendreau, M. (eds) Multidisciplinary Scheduling: Theory and Applications. Springer, Boston, MA. https://doi.org/10.1007/0-387-27744-7_8
Download citation
DOI: https://doi.org/10.1007/0-387-27744-7_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-25266-7
Online ISBN: 978-0-387-27744-8
eBook Packages: Business and EconomicsBusiness and Management (R0)