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

Single machine rescheduling for new orders with maximum and total time disruption constraints

Author

Listed:
  • Elena Rener

    (Politecnico di Torino
    University of Bern)

  • Fabio Salassa

    (Politecnico di Torino)

  • Vincent T’kindt

    (Politecnico di Torino
    Université de Tours)

Abstract

Rescheduling problems arise in a variety of situations where a previously planned schedule needs to be adjusted to deal with unforeseen events. A common problem is the arrival of new orders, i.e., jobs, which have to be integrated into the schedule of the so-called old jobs. The maximum and total absolute time deviations of the completion times of these jobs are modeled as a disruption constraint to limit the change in the original schedule. Disruption constraints influence the shape of an optimal schedule in particular with respect to the sequencing of old jobs and the insertion of idle time. In this paper, a classification into idle and no-idle problems is given, through several examples, for a set of single machine rescheduling problems with different objective functions. We also prove the complexity of four rescheduling problems that have been left open in the literature. Finally, algorithms are provided to solve the timing problem that arises for certain single machine rescheduling problems when the order of the jobs is fixed.

Suggested Citation

  • Elena Rener & Fabio Salassa & Vincent T’kindt, 2025. "Single machine rescheduling for new orders with maximum and total time disruption constraints," Journal of Scheduling, Springer, vol. 28(5), pages 469-482, October.
    • Handle: RePEc:spr:jsched:v:28:y:2025:i:5:d:10.1007_s10951-025-00837-0
    DOI: 10.1007/s10951-025-00837-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-025-00837-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-025-00837-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

    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:5:d:10.1007_s10951-025-00837-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.