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

A cut-and-branch algorithm for the external candidates examination scheduling problem

Author

Listed:
  • Pasquale Avella

    (Università del Sannio)

  • Maurizio Boccia

    (University of Naples)

  • Carlo Mannino

    (SINTEF Digital and University of Oslo)

  • Michele Mele

    (Università del Sannio)

  • Sandro Viglione

    (Università del Sannio)

Abstract

Twice a year, the regional school departments in Norway need to schedule examination sessions for external candidates in the region, which also involves reserving and assigning rooms, examiners and reviewers. We present a cut-and-branch algorithm to get provably good solutions to this problem, the external candidates examination scheduling problem (ExtSchedule). The algorithm relies on a new family of valid inequalities, effective in tightening the initial formulation and accelerating the solution process. We develop an efficient separation algorithm and embed it in a cut-and-branch framework to solve the problem. The algorithm has been validated on real-life instances arising from the Vestfold County school department in Norway.

Suggested Citation

  • Pasquale Avella & Maurizio Boccia & Carlo Mannino & Michele Mele & Sandro Viglione, 2025. "A cut-and-branch algorithm for the external candidates examination scheduling problem," Journal of Scheduling, Springer, vol. 28(6), pages 577-584, December.
    • Handle: RePEc:spr:jsched:v:28:y:2025:i:6:d:10.1007_s10951-024-00833-w
    DOI: 10.1007/s10951-024-00833-w
    as

    Download full text from publisher

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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    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:spr:jsched:v:28:y:2025:i:6:d:10.1007_s10951-024-00833-w. 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.