A conversion scheme for turning a curriculum-based timetabling problem into a school timetabling problem

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

Volumn , Issue , 2008, Pages

  Nurmi, Kimmo ^a   Kyngäs, Jari ^a  

^a SATAKUNTA UNIVERSITY OF APPLIED SCIENCES   (Finland)

Author keywords

Conversion scheme; Evolutionary algorithms; Heuristic search; Timetabling

Indexed keywords

CURRICULA; EVOLUTIONARY ALGORITHMS; HEURISTIC ALGORITHMS; SCHEDULING;

FEASIBLE SOLUTION; HEURISTIC SEARCH; PROBLEM INSTANCES; SCHOOL TIMETABLING; SCHOOL TIMETABLING PROBLEMS; TIMETABLING; TIMETABLING PROBLEM;

PROBLEM SOLVING;

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

References (20)

1. Burke, E.K., De Causmaecker, P. (2003). The Practice and Theory of Automated Timetabling IV: Revised Selected Papers from the 4th International conference, Gent 2002. Lecture Notes in Computer Science, vol. 2740, Springer.
2. Burke, E.K., Petrovic S. (2002). Recent Research Directions in Automated Timetabling. European Journal of Operational Research, 140/2, 266-280.
3. Burke, E.K., Rudová H. (2006). Proceedings of the 6th International Conference on the Practice and Theory of Automated Timetabling. Brno, Czech.
4. Burke, E.K., Trick M. (2005). The Practice and Theory of Automated Timetabling V: Revised Selected Papers from the 5th International conference, Pittsburgh 2004. Lecture Notes in Computer Science, vol. 3616, Springer.
5. Chekuri, C., Khanna, S. (2000). A PTAS for the multiple Knapsack problem. In: Proc. of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 213-222.
6. Cohen, R., Katzir, L., Raz, D. (2006). An Efficient Approximation for the Generalized Assignment Problem. Information Processing Letters, vol 100, Issue 4, 162-166.
7. De Cesco, F., Di Gaspero, L, Schaerf, A. (2008): Benchmarking Curriculum-Based Course Timetabling: Formulations, Data Formats, Instances, Validation, and Results. Submitted to the 7th International Conference on the Practice and Theory of Automated Timetabling. Montreal, Canada.
8. De Werra, D. (1985). An Introduction to Timetabling. European Journal of Operations Research, vol. 19, 151-162.
9. Di Gaspero, L., McCollum B., Schaerf, A. (2007): The 2nd International Timetabling Competition, Curriculum-based Course Timetabling (Track 3). Technical Report, http://www.cs.qub.ac.uk/itc2007/curriculmcourse/report/curriculumtechreport.pdf. Accessed 1 June 2008.
10. Fisher, M., Jaikumar, R., Van Wassenhove, L. (1986). A Multiplier Adjustment Method for the Generalized Assignment Problem. Management Science, vol. 32, 1095-1103.
11. Fleischer, L., Goemans, M. X., Mirrokni, V. S., Sviridenko, M. (2006). Tight Approximation Algorithms for Maximum General Assignment Problems. In: Proc. of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 611-620.
12. Kellerer, H., Pferschy, U., Pisinger, D. (2004). Knapsack Problems. Springer.
13. Lewis, R., Paechter, B., McCollum, B. (2007). Post Enrolment based Course Timetabling: A Description of the Problem Model used for Track Two of the 2nd Int. Timetabling Competition. Working Paper A2007-3, Cardiff University, Wales.
14. Martello, S., Toth P. (1990). Knapsack Problems: Algorithms and Computer Implementations. Wiley, New York.
15. McCollum, B. (2006). University Timetabling: Bridging the Gap between Research and Practice. In: Proc. of the 6th Int. Conf. on the Practice and Theory of Automated Timetabling, 15-35, Brno, Czech.
16. McCollum, B. (2007): The 2nd International Timetabling Competition, http://www.cs.qub.ac.uk/itc2007/index.htm. Accessed 1 June 2008.
17. Nurmi, K. (1998). Genetic Algorithms for Timetabling and Traveling Salesman Problems. University of Turku, Finland.
18. Nurmi, K., Kyngäs, J. (2007). A Framework for School Timetabling Problem. In: Proc. of the 3rd Multidisciplinary Int. Scheduling Conf.: Theory and Applications, 386-393, Paris, France.
19. Rasmussen, R.V., Trick, M.A. (2006). Round Robin Scheduling – a survey. Working Paper no. 2006/2, Department of Operations Research, University of Aarhus, Denmark.
20. Schaerf, A. (1999). A Survey of Automated Timetabling. Artificial Intelligence Review, 13/2, 87-127.