IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v70y2019i7p1039-1050.html
   My bibliography  Save this article

Modelling and solving the thesis defense timetabling problem

Author

Listed:
  • Michele Battistutta
  • Sara Ceschia
  • Fabio De Cesco
  • Luca Di Gaspero
  • Andrea Schaerf

Abstract

The thesis defense timetabling problem consists in composing the suitable committee for a set of defense sessions and assigning each graduation candidate to one of the sessions.In this work, we define the problem formulation that applies to some Italian universities and we provide three alternative solution methods, based on Integer Programming, Constraint Programming and Local Search, respectively. We also develop a principled instance generator, in order to expand the set of available instances.We perform an experimental analysis and we compare our solvers among themselves, using a testbed composed of both real-world and artificial instances. Even though there is no dominant method, the outcome is that Integer Programming gives the best average results, with Local Search being second, and Constraint Programming last on our testbed. All data is available on the web for verification and future comparisons.

Suggested Citation

  • Michele Battistutta & Sara Ceschia & Fabio De Cesco & Luca Di Gaspero & Andrea Schaerf, 2019. "Modelling and solving the thesis defense timetabling problem," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 70(7), pages 1039-1050, July.
    • Handle: RePEc:taf:tjorxx:v:70:y:2019:i:7:p:1039-1050
    DOI: 10.1080/01605682.2018.1495870
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2018.1495870
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2018.1495870?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Almeida, João & Santos, Daniel & Figueira, José Rui & Francisco, Alexandre P., 2024. "A multi-objective mixed integer linear programming model for thesis defence scheduling," European Journal of Operational Research, Elsevier, vol. 312(1), pages 92-116.
    2. Ceschia, Sara & Di Gaspero, Luca & Schaerf, Andrea, 2023. "Educational timetabling: Problems, benchmarks, and state-of-the-art results," European Journal of Operational Research, Elsevier, vol. 308(1), pages 1-18.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tjorxx:v:70:y:2019:i:7:p:1039-1050. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.