Selected Papers

• Özcan E, Burke EK, McCollum B, Kjenstad D, Riise A.  2016.  The Practice and Theory of Automated Timetabling (2012). Annals of Operations Research. 239:1–2.

  • Google Scholar
  • BibTeX
• Pillay N.  2016.  A review of hyper-heuristics for educational timetabling. Annals of Operations Research. 239:3–38.

  • Google Scholar
  • BibTeX
• J. Castillo-Salazar A, Landa-Silva D, Qu R.  2016.  Workforce scheduling and routing problems: literature survey and computational study. Annals of Operations Research. 239:39–67.

  • Google Scholar
  • BibTeX
• Post G, Di Gaspero L, Kingston JH, McCollum B, Schaerf A.  2016.  The Third International Timetabling Competition. Annals of Operations Research. 239:69–75.

  • Google Scholar
  • BibTeX
• da Fonseca GHenrique G, Santos HGambini, Toffolo TÂngelo Ma, Brito SSouza, Souza MJamilson F.  2016.  GOAL solver: a hybrid local search based solver for high school timetabling. Annals of Operations Research. 239:77–97.

  • Google Scholar
  • BibTeX
• Kristiansen S, Stidsen TR.  2016.  Elective course student sectioning at Danish high schools. Annals of Operations Research. 239:99–117.

  • Google Scholar
  • BibTeX
• Kingston JH.  2016.  Repairing high school timetables with polymorphic ejection chains. Annals of Operations Research. 239:119–134.

  • Google Scholar
  • BibTeX
• Kheiri A, Özcan E, Parkes AJ.  2016.  A stochastic local search algorithm with adaptive acceptance for high-school timetabling. Annals of Operations Research. 239:135–151.

  • Google Scholar
  • BibTeX
• Müller T, Rudová H.  2016.  Real-life curriculum-based timetabling with elective courses and course sections. Annals of Operations Research. 239:153–170.

  • Google Scholar
  • BibTeX
• Mühlenthaler M, Wanka R.  2016.  Fairness in academic course timetabling. Annals of Operations Research. 239:171–188.

  • Google Scholar
  • BibTeX
• van der Veen E., Hurink J.L, Schutten J.MJ, Uijland S.T.  2016.  A flexible iterative improvement heuristic to support creation of feasible shift rosters in self-rostering. Annals of Operations Research. 239:189–206.

  • Google Scholar
  • BibTeX
• van Veldhoven S, Post G, van der Veen E, Curtois T.  2016.  An assessment of a days off decomposition approach to personnel shift scheduling. Annals of Operations Research. 239:207–223.

  • Google Scholar
  • BibTeX
• Santos HG, Toffolo TAM, Gomes RAM, Ribas S.  2014.  Integer programming techniques for the nurse rostering problem. Annals of Operations Research.

  • Google Scholar
  • BibTeX
• Vancroonenburg W, De Causmaecker P, Berghe GVanden.  2016.  A study of decision support models for online patient-to-room assignment planning. Annals of Operations Research. 239:253–271.

  • Google Scholar
  • BibTeX
• Ásgeirsson EIngi, Siguroardóttir GLilla.  2016.  Near-optimal MIP solutions for preference based self-scheduling. Annals of Operations Research. 239:273–293.

  • Google Scholar
  • BibTeX
• Jouglet A, Nace D, Outteryck C.  2016.  Timetabling of sorting slots in a logistic warehouse. Annals of Operations Research. 239:295–316.

  • Google Scholar
  • BibTeX
• Lau HChuin, Yuan Z, Gunawan A.  2016.  Patrol scheduling in urban rail network. Annals of Operations Research. 239:317–342.

  • Google Scholar
  • BibTeX
• Goerigk M, Westphal S.  2016.  A combined local search and integer programming approach to the traveling tournament problem. Annals of Operations Research. 239:343–354.

  • Google Scholar
  • BibTeX