Selected Papers

• Özcan E, Burke EK, Di Gaspero L, McCollum B, Musliu N.  2021.  Preface: The practice and theory of automated timetabling (2018). Annals of Operations Research. 302:339–340.

  • Google Scholar
  • BibTeX
• Akkermans A, Post G, Uetz M.  2021.  Solving the shift and break design problem using integer linear programming. Annals of operations research. 302:341–362.

  • Google Scholar
  • BibTeX
• Wickert TI, Neto AFKummer, Boniatti MM, Buriol LS.  2021.  An integer programming approach for the physician rostering problem. Annals of Operations Research. 302:363–390.

  • Google Scholar
  • BibTeX
• Kingston JH.  2021.  Modelling history in nurse rostering. Annals of Operations Research. 302:391–404.

  • Google Scholar
  • BibTeX
• Herres B, Schmitz H.  2021.  Decomposition of university course timetabling. Annals of Operations Research. 302:405–423.

  • Google Scholar
  • BibTeX
• Karlsson E, Rönnberg E, Stenberg A, Uppman H.  2021.  A matheuristic approach to large-scale avionic scheduling. Annals of Operations Research. 302:425–459.

  • Google Scholar
  • BibTeX
• Ilani H, Grinshpoun T, Shufan E.  2021.  Bounded colouring motivated by the limited resource partially concurrent open shop problem. Annals of Operations Research. 302:461–476.

  • Google Scholar
  • BibTeX
• Horn M, Raidl GR, Rönnberg E.  2021.  A* search for prize-collecting job sequencing with one common and multiple secondary resources. Annals of Operations Research. 302:477–505.

  • Google Scholar
  • BibTeX
• Maschler J, Raidl GR.  2021.  Multivalued decision diagrams for prize-collecting job sequencing with one common and multiple secondary resources. Annals of Operations Research. 302:507–531.

  • Google Scholar
  • BibTeX
• Mischek F, Musliu N.  2021.  A local search framework for industrial test laboratory scheduling. Annals of Operations Research. 302:533–562.

  • Google Scholar
  • BibTeX