Makespan minimization with OR-precedence constraints
Year of publication: |
2021
|
---|---|
Authors: | Happach, Felix |
Published in: |
Journal of scheduling : JOS. - Dordrecht [u.a.] : Springer Science + Business Media, ISSN 1099-1425, ZDB-ID 2012329-2. - Vol. 24.2021, 3, p. 319-328
|
Subject: | Scheduling | Precedence constraints | Approximation algorithm | Makespan | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming |
-
Tight upper bounds for semi-online scheduling on two uniform machines with known optimum
Dósa, György, (2018)
-
Scheduling on uniform parallel machines with periodic unavailability constraints
Kaabi, Jihene, (2019)
-
Dubois-Lacoste, Jérémie, (2017)
- More ...
-
Makespan minimization with OR-precedence constraints
Happach, Felix, (2021)
-
Good clusterings have large volume
Borgwardt, Steffen, (2019)
-
An algorithm for the separation-preserving transition of clusterings
Borgwardt, Steffen Alexander, (2023)
- More ...