LP rounding and combinatorial algorithms for minimizing active and busy time
Year of publication: |
December 2017
|
---|---|
Authors: | Chang, Jessica ; Khuller, Samir ; Mukherjee, Koyel |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 20.2017, 6, p. 657-680
|
Subject: | Active time | Busy time | Batch scheduling | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Algorithmus | Algorithm |
-
A new LP rounding algorithm for the active time problem
CĒlinescu, Gruia, (2021)
-
Two-agent scheduling on mixed batch machines to minimise the total weighted makespan
Fan, Guo-Qiang, (2023)
-
Ozturk, Onur, (2012)
- More ...
-
Sequential Individual Rationality in Dynamic Ridesharing
Gopalakrishnan, Raga, (2019)
-
Lying behavior when payoffs are shared with charity : experimental evidence
Chua, Scott Lee, (2022)
-
Lying Behavior When the Payoffs are Shared with Charity : Experimental Evidence
Chua, Scott, (2020)
- More ...