Single machine rescheduling for new orders with maximum lateness minimization

Rener, Elena; Salassa, Fabio; t'Kindt, Vincent

doi:10.1016/j.cor.2022.105815

Cited by 4 publications

(1 citation statement)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Rescheduling is defined as a revision of an established schedule in response to new orders arrivals or any process disruption [1,2]. In rescheduling literature, the authors have been interested on different types of disruptions, such as the arrival of new orders [3,4], resources unavailability [5,6,7], job disappearance [8], raw materials lack [9,10].…”

Section: Introduction and Literature Reviewmentioning

confidence: 99%

Rescheduling of a Single Machine Problem Thanks to Time Dependent Variable Weights

Tighazoui,

Sauvey,

Sauer

et al. 2023

2023 9th International Conference on Control, Decision and Information Technologies (CoDIT)

View full text Add to dashboard Cite

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d'enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

show abstract

Section: Introduction and Literature Reviewmentioning

confidence: 99%

Rescheduling of a Single Machine Problem Thanks to Time Dependent Variable Weights

Tighazoui,

Sauvey,

Sauer

et al. 2023

2023 9th International Conference on Control, Decision and Information Technologies (CoDIT)

View full text Add to dashboard Cite

show abstract

Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs

Pferschy

Resch

Righini

2022

J Sched

View full text Add to dashboard Cite

Rescheduling can help to improve the quality of a schedule with respect to an initially given sequence. In this paper, we consider the possibility of rescheduling jobs arriving for processing at a single machine under the following limitations: (a) jobs can only be moved toward the end of the schedule and not toward the front, and (b) when a job is taken out of the sequence, it is put on a buffer of limited capacity before being reinserted in its new position closer to the end of the sequence. The buffer is organized as a stack with a last-in/first-out policy. As an objective function, we consider the minimization of the weighted number of late jobs. For this NP-hard problem, we first provide two different integer linear programming (ILP) formulations. Furthermore, we develop a branch-and-bound algorithm with a branching rule based on the movement of jobs. Then a new pseudo-polynomial dynamic programming algorithm is presented which utilizes dominance criteria and an efficient handling of states. Our computational experiments with up to 100 jobs show that this algorithm performs remarkably well and can be seen as the current method of choice.

show abstract

Rescheduling to trade off between global disruption of original jobs with flexibility and scheduling cost of new jobs

Chen,

Cheng,

et al. 2024

Omega

View full text Add to dashboard Cite

Single machine rescheduling for new orders with maximum lateness minimization

Cited by 4 publications

References 16 publications

Rescheduling of a Single Machine Problem Thanks to Time Dependent Variable Weights

Rescheduling of a Single Machine Problem Thanks to Time Dependent Variable Weights

Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs

Rescheduling to trade off between global disruption of original jobs with flexibility and scheduling cost of new jobs

Contact Info

Product

Resources

About