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 |
-
A note on scheduling identical parallel machines with preemptions and setup times
Boudhar, Mourad, (2025)
-
Scheduling on identical machines with preemption and setup times
Haned, Amina, (2024)
-
Pruning rules for optimal runway sequencing
De Maere, Geert, (2018)
- More ...
-
Khoury, Nabil, (1990)
-
Nouvelle configuration de la vie politique en Italie
Laroche, Pierre, (1995)
-
Italie: la classe dirigeante à la reconquête de la société
Laroche, Pierre, (1994)
- More ...