A new LP rounding algorithm for the active time problem
Year of publication: |
2021
|
---|---|
Authors: | Cǎlinescu, Gruia ; Wang, Kai |
Published in: |
Journal of scheduling : JOS. - Dordrecht [u.a.] : Springer Science + Business Media, ISSN 1099-1425, ZDB-ID 2012329-2. - Vol. 24.2021, 5, p. 543-552
|
Subject: | Approximation algorithm | Scheduling | Linear program rounding | Active time | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Scheduling-Verfahren | Scheduling problem |
-
Scheduling unrelated machines with two types of jobs
Vakhania, Nodari, (2014)
-
Happach, Felix, (2024)
-
A review of methods and algorithms for optimizing construction scheduling
Zhou, J., (2013)
- More ...
-
Combining ideas in crowdsourced idea generation
Wang, Kai, (2017)
-
China's export tax rebate and the duration of firm export spells
Anwar, Sajid, (2018)
-
Wang, Kai, (2019)
- More ...