IDEAS home Printed from https://ideas.repec.org/a/spr/snopef/v5y2024i3d10.1007_s43069-024-00346-4.html
   My bibliography  Save this article

Finding Near Optimal Solutions to the Thesis Defense Timetabling Problem by Exploiting Symmetries

Author

Listed:
  • Angelos Dimitsas

    (University of Ioannina)

  • Christos Gogos

    (University of Ioannina)

Abstract

Thesis Defense Timetabling is the problem of arranging meetings of graduation candidates and faculty members for evaluating the theses of the first ones. Several rules apply that guarantee that the evaluation process will be assigned to appropriate opponents based on their expertise, while work will be balanced among all faculty members. The problem is combinatorial in nature, and optimal solutions are hard to find and even harder to verify that they are indeed optimal. In this work we present an exact model of the problem that is solved using Constraint Programming. We augment this model by adding constraints that capture three types of symmetries that we identified. These additions make the models capable of finding near optimal solutions, in reasonable time, and this is demonstrated by running experiments on public datasets of Thesis Defense Timetabling problem instances. Several new best solutions and lower bounds are obtained. Our approach shows that exploiting intricate details of a problem can drive contemporary constraint programming solvers to optimal or near optimal solutions faster.

Suggested Citation

  • Angelos Dimitsas & Christos Gogos, 2024. "Finding Near Optimal Solutions to the Thesis Defense Timetabling Problem by Exploiting Symmetries," SN Operations Research Forum, Springer, vol. 5(3), pages 1-19, September.
    • Handle: RePEc:spr:snopef:v:5:y:2024:i:3:d:10.1007_s43069-024-00346-4
    DOI: 10.1007/s43069-024-00346-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s43069-024-00346-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s43069-024-00346-4?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.

    References listed on IDEAS

    as
    1. Zhenjie Wang & Jiewei Zhang & Hafeez Ullah, 2023. "Exploring the Multidimensional Perspective of Retail Investors’ Attention: The Mediating Influence of Corporate Governance and Information Disclosure on Corporate Environmental Performance in China," Sustainability, MDPI, vol. 15(15), pages 1-33, August.
    2. Stidsen, Thomas & Pisinger, David & Vigo, Daniele, 2018. "Scheduling EURO-k conferences," European Journal of Operational Research, Elsevier, vol. 270(3), pages 1138-1147.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. 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.
    2. Coulibalyaicha Massaran & Jingli Liu, 2024. "ESG Impact on Green Purchases: Côte d’Ivoire’s Retail Sector in the Digital Age," International Journal of Research and Innovation in Social Science, International Journal of Research and Innovation in Social Science (IJRISS), vol. 8(7), pages 1419-1450, July.
    3. Bulhões, Teobaldo & Correia, Rubens & Subramanian, Anand, 2022. "Conference scheduling: A clustering-based approach," European Journal of Operational Research, Elsevier, vol. 297(1), pages 15-26.
    4. Fabian Riquelme & Elizabeth Montero & Leslie Pérez-Cáceres & Nicolás Rojas-Morales, 2022. "A Track-Based Conference Scheduling Problem," Mathematics, MDPI, vol. 10(21), pages 1-25, October.
    5. Pylyavskyy, Yaroslav & Jacko, Peter & Kheiri, Ahmed, 2024. "A generic approach to conference scheduling with integer programming," European Journal of Operational Research, Elsevier, vol. 317(2), pages 487-499.
    6. Yanpeng Chen & Wenjun Mai, 2024. "Investor attention and environmental performance of Chinese high-tech companies: the moderating effects of media attention and coverage sentiment," Palgrave Communications, Palgrave Macmillan, vol. 11(1), pages 1-16, December.
    7. Guo, Huitao & Ye, Binghui & Chen, Yuxuan & Lin, Weizhen & Guan, Xinle & Mao, Ruoyu, 2024. "Investor attention and corporate leverage manipulation," Finance Research Letters, Elsevier, vol. 60(C).

    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:spr:snopef:v:5:y:2024:i:3:d:10.1007_s43069-024-00346-4. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.