Solving the international timetabling competition: a deterministic approach

MaRDI QIDQ2892659zbMATH OpenFDO

Authors Oscar Chávez-Bosquez, Pilar Pozos-Parra, Florian Lengyel

Publication date 19 June 2012

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL http://iospress.metapress.com/content/0j64k513605k04m3/fulltext.html

zbMATH Keywords

course timetabling problemdeterministic searchinternational timetabling competitionscheduling problemSTF algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• An IP-based heuristic for the post enrolment course timetabling problem of the ITC2007
• Curriculum based course timetabling: new solutions to Udine benchmark instances
• A time-dependent metaheuristic algorithm for post enrolment-based course timetabling
• Local search and constraint programming for the post enrolment-based course timetabling problem
• An overview of curriculum-based course timetabling

Cited in

(3)

• An IP-based heuristic for the post enrolment course timetabling problem of the ITC2007
• Setting the research agenda in automated timetabling: the second international timetabling competition
• Solution of the Meeting Time Choice Problem for n Persons

This page was built for publication: Solving the international timetabling competition: a deterministic approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2892659)