An Improved Approximation for Scheduling Malleable Tasks with Precedence Constraints via Iterative Method.
Chi-Yeh ChenPublished in: IEEE Trans. Parallel Distributed Syst. (2018)
Keyphrases
- precedence constraints
- approximation algorithms
- scheduling problem
- precedence relations
- branch and bound algorithm
- release dates
- parallel machines
- vertex cover
- parallel processors
- maximum lateness
- partial order
- partially ordered
- sequence dependent setup times
- series parallel
- setup times
- single machine
- np hard
- unit length
- single machine scheduling problem
- lower bound
- partially ordered sets
- global constraints
- processing times
- flowshop
- genetic algorithm
- tabu search
- linear programming
- optimization problems
- identical machines
- worst case
- upper bound
- total tardiness
- cost function
- release times
- special case
- optimal solution