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

Elena Rener (), Fabio Salassa () and Vincent T’kindt ()
Additional contact information
Elena Rener: Politecnico di Torino
Fabio Salassa: Politecnico di Torino
Vincent T’kindt: Politecnico di Torino

Journal of Scheduling, 2025, vol. 28, issue 5, No 1, 469-482

Abstract: 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.

Keywords: Rescheduling; Single machine; New orders; Maximum disruption; Total disruption (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10951-025-00837-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jsched:v:28:y:2025:i:5:d:10.1007_s10951-025-00837-0

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10951

DOI: 10.1007/s10951-025-00837-0

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

More articles in Journal of Scheduling from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().