On the extension complexity of scheduling polytopes
Year of publication: |
2020
|
---|---|
Authors: | Tiwary, Hans Raj ; Verdugo, Victor ; Wiese, Andreas |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 48.2020, 4, p. 472-479
|
Subject: | Extended formulations | Linear programming | Makespan scheduling | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Mathematische Optimierung | Mathematical programming | Durchlaufzeit | Lead time |
-
A note on scheduling on uniform parallel machines with unavailability constraints
Xu, Dehua, (2021)
-
Scheduling on uniform parallel machines with periodic unavailability constraints
Kaabi, Jihene, (2019)
-
Ozturk, Onur, (2017)
- More ...
-
The negative cycles polyhedron and hardness of checking some polyhedral properties
Boros, Endre, (2011)
-
The negative cycles polyhedron and hardness of checking some polyhedral properties
Boros, Endre, (2011)
-
Splitting versus setup trade-offs for scheduling to minimize weighted completion time
Correa, José, (2016)
- More ...