IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v28y2025i2d10.1007_s10951-024-00805-0.html
   My bibliography  Save this article

A proven optimal result for a benchmark instance of the uncapacitated examination timetabling problem

Author

Listed:
  • Angelos Dimitsas

    (University of Ioannina)

  • Christos Gogos

    (University of Ioannina)

  • Christos Valouxis

    (University of Patras)

  • Vasileios Nastos

    (University of Ioannina)

  • Panayiotis Alefragis

    (University of Peloponnese)

Abstract

Examination timetabling is a problem well known to the scheduling community. Its simplest version, which is the uncapacitated examination timetabling problem, is easily described and comprehended. Nevertheless, proof of optimality is notoriously difficult even for moderate size problems. In this paper, we describe the effort that our team exercised in finally proving the optimality of the sta83 instance of Carter’s dataset. The problem was decomposed naturally in three parts and for each part a different approach managed to prove optimality of the currently best known solution. This work also presents optimal solutions to subproblems that exist in various public datasets problems and two best known solutions of such problems.

Suggested Citation

  • Angelos Dimitsas & Christos Gogos & Christos Valouxis & Vasileios Nastos & Panayiotis Alefragis, 2025. "A proven optimal result for a benchmark instance of the uncapacitated examination timetabling problem," Journal of Scheduling, Springer, vol. 28(2), pages 183-194, April.
    • Handle: RePEc:spr:jsched:v:28:y:2025:i:2:d:10.1007_s10951-024-00805-0
    DOI: 10.1007/s10951-024-00805-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-024-00805-0
    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/s10951-024-00805-0?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.

    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:jsched:v:28:y:2025:i:2:d:10.1007_s10951-024-00805-0. 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: 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.