On Approximation of the Bulk Synchronous Task Scheduling Problem.
Noriyuki FujimotoKenichi HagiharaPublished in: IEEE Trans. Parallel Distributed Syst. (2003)
Keyphrases
- scheduling problem
- flowshop
- single machine
- np hard
- tabu search
- approximation algorithms
- processing times
- setup times
- earliness tardiness
- job shop scheduling problem
- relative error
- precedence constraints
- approximation error
- efficient computation
- asynchronous communication
- total tardiness
- release dates
- permutation flowshop
- minimizing makespan
- genetic algorithm