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

Solving the medical student scheduling problem using simulated annealing

Author

Listed:
  • Eugenia Zanazzo

    (University of Udine)

  • Sara Ceschia

    (University of Udine)

  • Agostino Dovier

    (University of Udine)

  • Andrea Schaerf

    (University of Udine)

Abstract

We consider the medical student scheduling (MSS) problem, which consists of assigning medical students to internships of different disciplines in various hospitals during the academic year to fulfill their educational and clinical training. The MSS problem takes into account, among other constraints and objectives, precedences between disciplines, student preferences, waiting periods, and hospital changes. We developed a local search technique, based on a combination of two different neighborhood relations and guided by a simulated annealing procedure. Our search method has been able to find the optimal solution for all instances of the dataset proposed by Akbarzadeh and Maenhout (Comput Oper Res 129: 105209, 2021b), in a much shorter runtime than their technique. In addition, we propose a novel dataset in order to test our technique on a more challenging ground. For this new dataset, which is publicly available along with our source code for inspection and future comparisons, we report the experimental results and a sensitivity analysis.

Suggested Citation

  • Eugenia Zanazzo & Sara Ceschia & Agostino Dovier & Andrea Schaerf, 2025. "Solving the medical student scheduling problem using simulated annealing," Journal of Scheduling, Springer, vol. 28(2), pages 233-246, April.
    • Handle: RePEc:spr:jsched:v:28:y:2025:i:2:d:10.1007_s10951-024-00806-z
    DOI: 10.1007/s10951-024-00806-z
    as

    Download full text from publisher

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