An XML format for benchmarks in high school timetabling

7th International Conference on the Practice and Theory of Automated Timetabling, PATAT 2008

Volumn , Issue , 2008, Pages

  Post, Gerhard ^a,b   Ahmadi, Samad ^c   Daskalaki, Sophia ^d   Kingston, Jeffrey H ^e   Kyngas, Jari ^f   Nurmi, Cimmo ^f   Ranson, David ^g   Ruizenaar, Henri ^a,h  

^a UNIVERSITY OF TWENTE   (Netherlands)

^b ORTEC The Netherlands   (Netherlands)

^c DE MONTFORT UNIVERSITY   (United Kingdom)

^d UNIVERSITY OF PATRAS   (Greece)

^e UNIVERSITY OF SYDNEY   (Australia)

^f SATAKUNTA UNIVERSITY OF APPLIED SCIENCES   (Finland)

^g UNIVERSITY OF SUSSEX   (United Kingdom)

^h Locatie Kottenpark   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EDUCATIONAL SYSTEMS; HIGH SCHOOL; HIGH SCHOOL TIMETABLING PROBLEMS; TIMETABLING PROBLEM; XML FORMAT; XML SCHEMAS;

SCHEDULING;

EID: 84857456622     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (34)

1. D. Abramson, ‘Constructing school timetables using simulated annealing: sequential and parallel algorithms’, Management Science Vol. 37, pp. 98-113, (1991).
2. T. Birbas, S. Daskalaki, and E. Housos, ‘Timetabling for Greek high schools’, Journal of the Operational Research Society 48, pp. 1191–1200, (1997).
3. E.K. Burke, J.H. Kingston, and P.A. Pepper, ‘A standard data format for timetabling instances’, in ‘Practice and Theory of Automated Timetabling II’, E. Burke and M. Carter (Eds.), Lecture Notes in Computer Science 1408, Springer Verlag, pp. 213–222, (1998).
4. E.K. Burke and S. Petrovic, ‘Recent research directions in automated timetabling’, European Journal of Operational Research 140, pp. 266–280, (2002).
5. E.K. Burke, B. McCollum, P. McMullan, and R. Qu, ‘Examination timetabling: a new formulation’, Proceedings of the Sixth International Conference of the Practice and Theory of Automated Timetabling (PATAT 2006), Brno, pp. 373–375, (2006).
6. M. Carter, G. Laporte, and S. T. Lee, ‘Examination timetabling: algorithmic strategies and applications’, Journal of the Operational Research Society 47, pp. 373–383, (1996).
7. M.W. Carter and G. Laporte, ‘Recent developments in practical course timetabling’, in ‘Practice and Theory of Automated Timetabling II’, E. Burke and M. Carter (Eds.), Lecture Notes in Computer Science 1408, Springer Verlag, pp. 3–19, (1998).
8. A. Chand, ‘A constraint based generic model for representing complete university timetabling data’, Proceedings of the Fifth International Conference on the Practice and Theory of Automated Timetabling (PATAT 2004), Pittsburgh, pp. 125–148, (2004).
9. T.B. Cooper and J. Kingston, ‘The solution of real instances of the timetabling problem’, The Computer Journal 36, pp. 645–653, (1993).
10. A. Cumming and B. Paechter, ‘Standard formats for timetabling data’, Unpublished discussion session at the First International Conference on the Practice and Theory of Automated Timetabling, Edinburgh, (2005).
11. N. Custers, P. De Causmaecker, P. Demeester, and G. Vanden Berghe, ‘Semantic components for timetabling’, in ‘Practice and Theory of Automated Timetabling V’, E. Burke and M. Trick (Eds.), Lecture Notes in Computer Science 3616, Springer Verlag, pp. 17–33, (2005).
12. P. De Causmaecker, P. Demeester, P. De Pauw-Waterschoot and G. Vanden Berghe, ‘Ontology for timetabling’, Proceedings of the Third International Conference on the Practice and Theory of Automated Timetabling (PATAT 2000), Konstanz, pp. 481–482, (2000).
13. P. De Causmaecker, P. Demeester, Y. Lu and G. Vanden Berghe, ‘Using web standards for timetabling’, Proceedings of the Fourth International Conference on the Practice and Theory of Automated Timetabling (PATAT 2002), Gent, pp. 238–257, (2002).
14. K. Easton, G. L. Nemhauser, and M. A. Trick, ‘The travelling tournament problem: description and benchmarks’, in ‘Principles and Practice of Constraint Programming (CP 2001)’, Lecture Notes in Computer Science 2239, Springer Verlag, pp. 580–585, (2001).
15. O.B. de Gans, ‘A computer timetabling system for secondary schools in the Netherlands’, European Journal of Operational Research 7, pp. 175–182, (1981).
16. M. Gröbner, P. Wilke, and S. Büttcher, ‘A standard framework for timetabling problems’, in ‘Practice and Theory of Automated Timetabling IV’, E. Burke and P. De Causmaecker (Eds.), Lecture Notes in Computer Science 2740, Springer Verlag, pp. 24–38, (2003).
17. P. de Haan, R. Landman, G. Post, and H. Ruizenaar, ‘A case study for timetabling in a Dutch secondary school’, in ‘Practice and Theory of Automated Timetabling VI’, E. Burke and H. Rudová (Eds.), Lecture Notes in Computer Science 3867, Springer Verlag, pp. 267–279, (2007).
18. J. H. Kingston, ‘Modelling timetabling problems with STTL’, in ‘Practice and Theory of Automated Timetabling III’, E.K. Burke and W. Erben (Eds), Lecture Notes in Computer Science 2079, Springer Verlag, pp. 309–321, (2001).
19. J.H. Kingston, ‘A tiling algorithm for high school timetabling’, in ‘Practice and Theory of Automated Timetabling V’, E. Burke and M. Trick (Eds.), Lecture Notes in Computer Science 3616, Springer Verlag, pp. 208–225, (2005).
20. F. Kitagawa and H. Ikeda, ‘An existential problem of a weight-controlled subset and its application to school timetable construction’, Discrete Mathematics 72, pp. 195–211, (1988).
21. J. Monteiro da Mata, A. Luiz de Senna, and M. Augusto de Andrade, ‘Towards a language for the specification of timetabling problems’, Proceedings of the Second International Conference on the Practice and Theory of Automated Timetabling (PATAT’97), Toronto, pp. 330–333, (1997).
22. K. Nurmi and J. Kyngas, ‘A Framework for School Timetabling Problem’, Proceedings of the 3rd Multidisciplinary International Scheduling Conference: Theory and Applications, Paris, pp. 386–393, (2007).
23. http://www.cs.nott.ac.uk/∼tec/NRP/.
24. E. Özcan, ‘Towards an XML-Based Standard for Timetabling Problems: TTML’, Multidisciplinary Scheduling: Theory and Applications (First International Conference, MISTA’03, Nottingham, Selected Papers), pp. 163–185, (2005).
25. Ben Paechter, ‘International timetabling competition’, http://www.idsia.ch/Files/ttcomp2002/, (2003).
26. D. Ranson and S. Ahmadi, ‘An extensible modelling framework for the examination timetabling problem’, in ‘Practice and Theory of Automated Timetabling VI’, E. Burke and H. Rudová (Eds.), Lecture Notes in Computer Science 3867, Springer Verlag, pages 383–393, (2006).
27. L.P. Reis and E. Oliveira, ‘A language for specifying complete timetabling problems’, in ‘Practice and Theory of Automated Timetabling III’, E.K. Burke and W. Erben (Eds), Lecture Notes in Computer Science 2079, Springer Verlag, pp. 322–341, (2001).
28. A. Schaerf, ‘A survey of automated timetabling’, Artificial Intelligence Review 13, No. 2, pp. 87–127, (1999).
29. C. Valouxis and E. Housos, ‘Constraint programming approach for school timetabling’, Computers & Operations Research 30, pp. 1555–1572, (2003).
30. D. de Werra, ‘An introduction to timetabling’, European Journal of Operational Research 19, pp. 151–162, (1985).
31. D. de Werra, ‘On a multiconstrained model for chromatic scheduling’, Discrete Applied Mathematics 94, pp. 171–180, (1999).
32. R.J. Willemen, ‘School timetable construction; algorithms and complexity’, PhD-thesis, Technical University Eindhoven, The Netherlands, (2002).
33. M. Wright, ‘School timetabling using heuristic search’, Journal of Operational Research Society 47, pp. 347–357, (1996).
34. http://www.w3schools.com/xml/or http://en.wikipedia.org/wiki/XML.