Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines
| Year of publication: |
2020
|
|---|---|
| Authors: | Alhadi, Gais ; Kacem, Imed ; Laroche, Pierre ; Osman, Izzeldin M. |
| Published in: |
Project management and scheduling. - New York, NY, USA : Springer. - 2020, p. 369-395
|
| Subject: | Approximation | Maximum lateness | Makespan | Dynamic programming | PTAS | FPTAS | Algorithmus | Algorithm | Durchlaufzeit | Lead time | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Dynamische Optimierung |
-
Scheduling on identical machines with preemption and setup times
Haned, Amina, (2024)
-
A note on scheduling identical parallel machines with preemptions and setup times
Boudhar, Mourad, (2025)
-
Pruning rules for optimal runway sequencing
De Maere, Geert, (2018)
- More ...
-
The value of liquidity from the hedge fund portfolio manager’s perspective
Gagnon, Martin, (2011)
-
Khoury, Nabil, (1990)
-
A branch-and-cut algorithm for the connected max-k-cut problem
Healy, Patrick, (2024)
- More ...