A 3.42-Approximation Algorithm for Scheduling Malleable Tasks under Precedence Constraints.
Chi-Yeh ChenChih-Ping ChuPublished in: IEEE Trans. Parallel Distributed Syst. (2013)
Keyphrases
- precedence constraints
- vertex cover
- parallel machines
- worst case
- scheduling problem
- optimal solution
- dynamic programming
- computational complexity
- np hard
- probabilistic model
- parallel processors
- linear programming
- tabu search
- error bounds
- branch and bound algorithm
- approximation algorithms
- space complexity
- job shop scheduling problem
- cost function
- single machine scheduling problem
- evolutionary algorithm