IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v63y2025i8p2711-2740.html
   My bibliography  Save this article

A multi-level rescheduling approach for a dynamic remote operations scheduling problem

Author

Listed:
  • Annalisa Castelletti
  • Lorenzo Moreschini
  • Marzia Corvaglia
  • Renata Mansini

Abstract

In this paper, we tackle a dynamic scheduling problem faced by a large international company. The problem involves assigning installation projects arriving over time to specialised technicians who execute them remotely. Each project consists of several tasks having processing times, release dates, and execution deadlines. The company needs to assign projects to technicians and schedule tasks complying with technicians' skills, precedence constraints between tasks, and tasks requiring multiple technicians simultaneously. The problem is dynamic as new projects and tasks become available over time, requiring their allocation to technicians. We formulate the offline problem as a mixed integer linear program that minimises the makespan, and we address the dynamic version solving restricted problems within a rolling horizon framework. The approach systematically implements different levels of schedule adjustment to incorporate new information. To study scalability, we validate our algorithm by using both real-world and synthetic simulations demonstrating its efficiency and effectiveness. Additionally, we provide interesting managerial insights for the company.

Suggested Citation

  • Annalisa Castelletti & Lorenzo Moreschini & Marzia Corvaglia & Renata Mansini, 2025. "A multi-level rescheduling approach for a dynamic remote operations scheduling problem," International Journal of Production Research, Taylor & Francis Journals, vol. 63(8), pages 2711-2740, April.
    • Handle: RePEc:taf:tprsxx:v:63:y:2025:i:8:p:2711-2740
    DOI: 10.1080/00207543.2024.2408438
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2024.2408438
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2024.2408438?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.

    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:tprsxx:v:63:y:2025:i:8:p:2711-2740. 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/TPRS20 .

    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.