Malleable scheduling for flows of jobs and applications to MapReduce
Year of publication: |
2019
|
---|---|
Authors: | Nagarajan, Viswanath ; Wolf, Joel ; Balmin, Andrey ; Hildrum, Kirsten |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 22.2019, 4, p. 393-411
|
Subject: | Parallel scheduling | Precedence constraints | Approximation algorithms | MapReduce | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Theorie | Theory | Heuristik | Heuristics |
-
Model of megalopolises in the tool path optimisation for CNC plate cutting machines
Čencov, Aleksandr Georgievič, (2018)
-
Procedures for the bin packing problem with precedence constraints
Pereira, Jordi, (2016)
-
Makespan minimization with OR-precedence constraints
Happach, Felix, (2021)
- More ...
-
Technical Note-Approximation Algorithms for VRP with Stochastic Demands
Gupta, Anupam, (2012)
-
On the Maximum Quadratic Assignment Problem
Nagarajan, Viswanath, (2009)
-
Tight Bounds for Permutation Flow Shop Scheduling
Nagarajan, Viswanath, (2009)
- More ...