Login / Signup
A Constant-Factor Approximation for Generalized Malleable Scheduling Under $M^\natural $-Concave Processing Speeds.
Dimitris Fotakis
Jannik Matuschke
Orestis Papadigenopoulos
Published in:
IPCO (2022)
Keyphrases
</>
scheduling problem
data processing
scheduling algorithm
batch processing
constant factor approximation
real time
approximation algorithms
objective function
search algorithm
high speed
genetic algorithm
information processing
resource constraints
parallel machines
round robin