Optimally rescheduling jobs with a Last-In-First-Out buffer
| Year of publication: |
2021
|
|---|---|
| Authors: | Nicosia, Gaia ; Pacifici, Andrea ; Pferschy, Ulrich ; Resch, Julia ; Righini, Giovanni |
| Published in: |
Journal of scheduling : JOS. - Dordrecht [u.a.] : Springer Science + Business Media, ISSN 1099-1425, ZDB-ID 2012329-2. - Vol. 24.2021, 6, p. 663-680
|
| Subject: | Scheduling | Rescheduling | Sequence coordination | Supply chain sustainability | Dynamic programming algorithms | Complexity | Lieferkette | Supply chain | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Dynamische Optimierung | Dynamic programming | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm |
-
Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs
Pferschy, Ulrich, (2023)
-
Solving multi-agent scheduling problems on parallel machines with a global objective function
Sadi, Faiza, (2014)
-
Rescheduling for machine disruption to minimize makespan and maximum lateness
Liu, Zhixin, (2014)
- More ...
-
Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs
Pferschy, Ulrich, (2023)
-
On the Stackelberg knapsack game
Pferschy, Ulrich, (2021)
-
Profit-fairness trade-off in project selection
Naldi, Maurizio, (2019)
- More ...