15
Views
1
CrossRef citations to date
0
Altmetric
Technical Note

A model for timetabling problems with period spread constraints

, , &
Pages 217-222 | Received 01 Apr 2009, Accepted 01 Oct 2009, Published online: 21 Dec 2017

References

  • BurkeEKPetrovicSRecent research directions in automated timetablingEur J Opl Res200214026628010.1016/S0377-2217(02)00069-3
  • BurkeEKJacksonKKingstonJWeareRAutomated university timetabling: The state of the artComput J19974056557110.1093/comjnl/40.9.565
  • ČangalovićMSchreuderJAMExact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengthsEur J Opl Res19915124825810.1016/0377-2217(91)90254-S
  • CarterMWLaporteGRecent developments in practical course timetablingPractice and Theory of Automated Timetabling (PATAT) II. LNCS1998319
  • FeoTAResendeMGCGreedy randomized adaptive search proceduresJ Global Optim1995610913410.1007/BF01096763
  • LewisRAA survey of metaheuristic-based techniques for University Timetabling problemsOR Spectrum20083016719010.1007/s00291-007-0097-0
  • McCollum B, Schaerf A, Paechter B, McMullan P, Lewis R, Parkes A, Di Gaspero L, Qu R and Burke E (2009). Setting the research agenda in automated timetabling: The second International Timetabling Competition, accepted for publication to INFORMS Journal on Computing, doi: 10.1287/ijoc.1090.0320.
  • NandhiniMKanmaniSA survey of simulated annealing methodology for University Course TimetablingInternational Journal of Recent Trends in Engineering20091255257
  • Ramírez J (2001). Extensiones del problema de coloración de grafos. Universidad Complutense de Madrid; Spain, ISBN 84-669-1855-8. http://www.ucm.es/BUCM/tesis/mat/ucm-t24770.pdf, accessed 17 April 2009.
  • RobertsFST-colorings of graphs: Recent results and open problemsDiscrete Math19919322924510.1016/0012-365X(91)90258-4
  • de WerraDAn introduction to timetablingEur J Opl Res19851915116210.1016/0377-2217(85)90167-5
  • de WerraDSome combinatorial models for course schedulingPractice and Theory of Automated Timetabling, LNCS1996296308
  • YáñezJRamírezJThe robust coloring problemEur J Opl Res200314854655810.1016/S0377-2217(02)00362-4

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.