An approximation algorithm for scheduling dependent tasks on m processors with small communication delays.
Claire HanenAlix MunierPublished in: Discret. Appl. Math. (2001)
Keyphrases
- communication delays
- multiprocessor systems
- execution times
- np hard
- dynamic programming
- optimal solution
- error bounds
- ant colony optimization
- benchmark problems
- parallel implementation
- parallel machines
- scheduling problem
- computational complexity
- list scheduling
- particle swarm optimization
- simulated annealing
- objective function