Non-approximability of the Bulk Synchronous Task Scheduling Problem.
Noriyuki FujimotoKenichi HagiharaPublished in: Euro-Par (2002)
Keyphrases
- scheduling problem
- single machine
- flowshop
- approximation algorithms
- np hard
- processing times
- tabu search
- setup times
- precedence constraints
- parallel machines
- minimizing makespan
- permutation flowshop
- earliness tardiness
- total tardiness
- asynchronous communication
- sequence dependent setup times
- maximum lateness
- limited capacity
- unrelated parallel machines
- search engine
- release dates
- job shop scheduling problem
- optimization problems
- lower bound
- machine learning