An Improved Approximation Algorithm for Scheduling Under Arborescence Precedence Constraints.
Kim Thang NguyenPublished in: MFCS (2020)
Keyphrases
- precedence constraints
- search space
- parallel machines
- scheduling problem
- single machine scheduling problem
- dynamic programming
- single machine
- precedence relations
- parallel processors
- integer programming
- objective function
- simulated annealing
- worst case
- computational complexity
- optimal solution
- ant colony optimization
- error bounds
- processing times
- space complexity
- np hard
- lagrangian relaxation
- cost function
- special case
- approximation ratio
- maximum lateness
- vertex cover