Selected Papers

• Abdul-Rahman S, Burke EK, Bargiela A, McCollum B, Özcan E.  2014.  A constructive approach to examination timetabling based on adaptive decomposition and ordering. Annals of Operations Research. 218:3-21.

  • Google Scholar
  • BibTeX
• Al-Betar MAzmi, Khader ATajudin, Doush IAbu.  2014.  Memetic techniques for examination timetabling. Annals of Operations Research. 218:23-50.

  • Google Scholar
  • BibTeX
• Ásgeirsson E I.  2014.  Bridging the gap between self schedules and feasible schedules in staff scheduling. Annals of Operations Research. 218:51-69.

  • Google Scholar
  • BibTeX
• Achá RAsín, Nieuwenhuis R.  2014.  Curriculum-based course timetabling with SAT and MaxSAT. Annals of Operations Research. 218:71-91.

  • Google Scholar
  • BibTeX
• Borndörfer R, Erol B, Graffagnino T, Schlechte T, Swarat E.  2014.  Optimizing the Simplon railway corridor. Annals of Operations Research. 218:93-106.

  • Google Scholar
  • BibTeX
• Brucker P, Qu R.  2014.  Network flow models for intraday personnel scheduling problems. Annals of Operations Research. 218:107-114.

  • Google Scholar
  • BibTeX
• Buiteveld B, van Holland E, Post G, Smit D.  2014.  Round-robin tournaments with homogeneous rounds. Annals of Operations Research. 218:115-128.

  • Google Scholar
  • BibTeX
• Burke EK, Qu R, Soghier A.  2014.  Adaptive selection of heuristics for improving exam timetables. Annals of Operations Research. 218:129-145.

  • Google Scholar
  • BibTeX
• Ceschia S, Di Gaspero L, Schaerf A.  2014.  The generalized balanced academic curriculum problem with heterogeneous classes. Annals of Operations Research. 218:147-163.

  • Google Scholar
  • BibTeX
• Constantino AAparecido, Landa-Silva D, de Melo ELuiz, de Mendonça CFerreira X, Rizzato DBaroni, Romão W.  2014.  A heuristic algorithm based on multi-assignment procedures for nurse scheduling. Annals of Operations Research. 218:165-183.

  • Google Scholar
  • BibTeX
• Della Croce F, Salassa F.  2014.  A variable neighborhood search based matheuristic for nurse rostering problems. Annals of Operations Research. 218:185-199.

  • Google Scholar
  • BibTeX
• Günther M, Nissen V.  2014.  A comparison of three heuristics on a practical case of sub-daily staff scheduling. Annals of Operations Research. 218:201-219.

  • Google Scholar
  • BibTeX
• Haspeslagh S, De Causmaecker P, Schaerf A, Stølevik M.  2014.  The first international nurse rostering competition 2010. Annals of Operations Research. 218:221-236.

  • Google Scholar
  • BibTeX
• Imahori S, Matsui T, Miyashiro R.  2014.  A 2.75-approximation algorithm for the unconstrained traveling tournament problem. Annals of Operations Research. 218:237-247.

  • Google Scholar
  • BibTeX
• Kingston JH.  2014.  Timetable construction: the algorithms and complexity perspective. Annals of Operations Research. 218:249-259.

  • Google Scholar
  • BibTeX
• Pillay N.  2014.  A survey of school timetabling research. Annals of Operations Research. 218:261-293.

  • Google Scholar
  • BibTeX
• Post G, Kingston JH., Ahmadi S, Daskalaki S, Gogos C, Kyngas J, Nurmi C, Musliu N, Pillay N, Santos H et al..  2014.  XHSTT: an XML archive for high school timetabling problems in different countries. Annals of Operations Research. 218:295-301.

  • Google Scholar
  • BibTeX
• Smet P, Bilgin B, De Causmaecker P, Vanden Berghe G.  2014.  Modelling and evaluation issues in nurse rostering. Annals of Operations Research. 218:303-326.

  • Google Scholar
  • BibTeX
• Wehrer A, Yellen J.  2014.  The design and implementation of an interactive course-timetabling system. Annals of Operations Research. 218:327-345.

  • Google Scholar
  • BibTeX
• Westphal S, Noparlik K.  2014.  A 5.875-approximation for the Traveling Tournament Problem. Annals of Operations Research. 218:347-360.

  • Google Scholar
  • BibTeX