Hierarchical timetable construction

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3867 LNCS, Issue , 2006, Pages 294-307

  Kingston, Feffrey H ^a  

^a UNIVERSITY OF SYDNEY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; HIERARCHICAL SYSTEMS; MATHEMATICAL OPERATORS; SCHEDULING ALGORITHMS;

HIERARCHICAL TIMETABLES; TIMETABLE CONSTRUCTION;

PROBLEM SOLVING;

EID: 38549132862     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (18)

1. Adriaen, M., De Causmaecker, P., Demeester, P., Vanden Berghe, G.: Tackling the university course timetabling problem with an aggregation approach. In: Proceedings of the 6th International Conference on the Practice and Theory of Automated Timetabling, Brno, pp. 330-335 (August 2006)
2. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs, NJ (1993)
3. Apt, K.R.: Principles of Constraint Programming. Cambridge University Press, Cambridge (2003)
4. Burke, E.K., Carter, M. (eds.): PATAT 1997. LNCS, vol. 1408. Springer, Heidelberg (1998)
5. Burke, E.K., De Causmaecker, P. (eds.): PATAT 2002. LNCS, vol. 2740. Springer, Heidelberg (2003)
6. Burke, E., Erben, W. (eds.): PATAT 2000. LNCS, vol. 2079. Springer, Heidelberg (2001)
7. Burke, E.K., Ross, P. (eds.): Practice and Theory of Automated Timetabling. LNCS, vol. 1153. Springer, Heidelberg (1996)
8. Burke, E.K., Trick, M.A. (eds.): PATAT 2004. LNCS, vol. 3616. Springer, Heidelberg (2005)
9. Carter, M.W., Laporte, G.: Recent developments in practical course timetabling. In: Burke, E.K., Carter, M. (eds.) PATAT 1997. LNCS, vol. 1408, pp. 3-19. Springer, Heidelberg (1998)
10. Cooper, T.B., Kingston, J.H.: The solution of real instances of the timetabling problem. The Computer Journal 36, 645-653 (1993)
11. Fizzano, P., Swanson, S.: Scheduling classes on a college campus. Computational Optimization and Applications 16, 279-294 (2000)
12. van Hoeve, W.J.: A hyper-arc consistency algorithm for the soft alldifferent constraint. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 679-689. Springer, Heidelberg (2004)
13. Kingston, J.H.: A tiling algorithm for high school timetabling. In: Burke, E.K., Trick, M.A. (eds.) PATAT 2004. LNCS, vol. 3616, pp. 233-249. Springer, Heidelberg (2005)
14. Kingston, J.H.: The KTS high school timetabling web site (Version 1.3) (October 2005) ,http://www.it.usyd.edu.au/~ jeff
15. Kingston, J.H.: The KTS high school timetabling system. In: Burke, E.K., Rudová, H. (eds.) PATAT 2006. LNCS, vol. 3867, pp. 308-323. Springer, Heidelberg (2007)
16. Marte, M.: Towards constraint-based school timetabling. In: Proceedings of the Workshop on Modelling and Solving Problems with Constraints (at ICAI 2004), pp. 140-154 (2004)
17. Van Hentenryck, P.: The OPL Optimization Programming Language. MIT Press, Cambridge, MA (1999)
18. de Werra, D.: An introduction to timetabling. European Journal of Operational Research 19, 151-162 (1985)