Efficient approximation algorithms for scheduling moldable tasks.

Xiaohu Wu Patrick Loiseau

Published in: Eur. J. Oper. Res. (2023)

Keyphrases

approximation algorithms
np hard
special case
precedence constraints
worst case
vertex cover
scheduling problem
network design problem
facility location problem
scheduling algorithm
minimum cost
set cover
randomized algorithms
open shop
approximation ratio
parallel machines
combinatorial auctions