% This file was created with JabRef 2.3.1.
% Encoding: Cp1252

@INPROCEEDINGS{Cambazard2008:patat:local,
  author = {Hadrien Cambazard and Emmanuel Hebrard and Barry OSullivan and Alexandre
	Papadopoulos},
  title = {Local Search and Constraint Programming for the Post Enrolment-based
	Course Timetabling Problem},
  booktitle = {Proceedings of PATAT 2008},
  year = {2008},
  abstract = {We present a study of the university post-enrolment timetabling problem,
	proposed as Track 2 of the 2007 International Timetabling Competition.
	We approach the problem using several techniques, particularly local
	search, constraint programming techniques and hybrids of these in
	the form of a large neighbourhood search scheme. Our local search
	approach won the competition. Our best constraint programming approach
	uses an original problem decomposition. Incorporating this into a
	large neighbourhood search scheme seems promising.}
}

@ARTICLE{Lewis2007:survey,
  author = {Lewis, R.},
  title = {A Survey of Metaheuristic-based Techniques for University Timetabling
	Problems},
  journal = {OR Spectrum},
  year = {2007},
  volume = {30},
  pages = {167-190},
  number = {1},
  abstract = {As well as nearly always belonging to the class of NP-complete problems,
	university timetabling problems can be further complicated by the
	often idiosyncratic requirements imposed by the particular institution
	being considered. It is perhaps due to this characteristic that in
	the past decade-or-so, metaheuristics have become increasingly popular
	in the field of automated timetabling. In this paper we carry out
	an overview of such applications, paying particular attention to
	the various methods that have been proposed for dealing and differentiating
	between constraints of varying importance. Our review allows us to
	classify these algorithms into three general classes, and we make
	some instructive comments on each of these.},
  doi = {10.1007/s00291-007-0097-0}
}

@PHDTHESIS{Lewis2006:phd,
  author = {Lewis, R.},
  title = {Metaheuristics for University Course Timetabling},
  school = {School of Computing, Napier University, Edinburgh},
  year = {2006},
  month = {October}
}

@INCOLLECTION{LewisPaechterRossi2007:metaheuristics,
  author = {Lewis, R. and B., Paechter and Rossi-Doria, O.},
  title = {Metaheuristics for University Course Timetabling},
  booktitle = {In Evolutionary Scheduling (Studies in Computational Intelligence
	vol. 49)},
  publisher = {Springer-Verlag},
  year = {2007},
  editor = {Dahal K. and Kay Chen Tan, and Cowling P.},
  pages = {237-272},
  address = {Berlin}
}

@TECHREPORT{LewisPaechterMcCollum2007,
  author = {Lewis, R. and Paechter, B. and McCollum, B.},
  title = {Post Enrolment based Course Timetabling: A Description of the Problem
	Model used for Track Two of the Second International Timetabling
	Competition},
  institution = {Cardiff Business School, Cardiff University},
  year = {2007},
  type = {Cardiff Working Papers in Accounting and Finance},
  number = {A2007-3},
  month = {August},
  issn = {1750-6658}
}

@ARTICLE{Lu2008:solvingCTT,
  author = {Zhipeng Lu and Jin-Kao Hao},
  title = {Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm},
  journal = {LNAI},
  year = {2008},
  volume = {5253},
  pages = {262-273},
  note = {Proceedings of 13th International Conference on Artificial Intelligence:
	Methodology, Systems, Applications (AIMSA'08). D. Dochev, M. Pistore,
	and P. Traverso (eds).},
  abstract = {The problem of curriculum-based course timetabling is studied in this
	work. In addition to formally defining the problem, we present a
	hybrid solution algorithm (Adaptive Tabu SearchATS), which is aimed
	at minimizing violations of soft constraints. Within ATS, a new neighborhood
	and a mechanism for dynamically integrating Tabu Search with perturbation
	(from Iterated Local Search) are proposed to ensure a continuous
	tradeoff between intensification and diversification. The performance
	of the proposed hybrid heuristic algorithm is assessed on two sets
	of 11 public instances from the literature. Computational results
	show that it significantly improves the previous best known results
	on two problem formulations.}
}

@MISC{McCollum2008:new-model,
  author = {Barry McCollum and Paul McMullan and Edmund K. Burke and Andrew J.
	Parkes and Rong Qu},
  title = {A New Model for Automated Examination Timetabling},
  year = {2008},
  note = {An extended version of \cite{McCollum07:exam-track}. Under Review.},
  institution = {Queen's University Belfast}
}

@TECHREPORT{McCollum07:itc-exam-track,
  author = {Barry McCollum and Paul McMullan and Edmund K. Burke and Andrew J.
	Parkes and Rong Qu},
  title = {The Second {I}nternational {T}imetabling {C}ompetition: Examination
	Timetabling Track},
  institution = {Queen's University, Belfast},
  year = {2007},
  number = {QUB/IEEE/\-Tech/\-ITC2007/\-Exam/v4.0/17},
  month = {Sep},
  note = {Available from \texttt{http://www.cs.qub.ac.uk/itc2007/}}
}

@MISC{McCollum2008:ITC2007,
  author = {B. McCollum and A. Schaerf and B. Paechter and P. McMullan and R.
	Lewis and L. Di Gaspero and A. J. Parkes and R. Qu and E. K. Burke},
  title = {Setting the Research Agenda in Automated Timetabling: The Second
	International Timetabling Competition},
  year = {2008},
  note = {Under review},
  url = {http://www.cs.qub.ac.uk/itc2007/ITC2007_Background_Techreportv1.pdf}
}