A parallel approximation scheme for the multiprocessor scheduling problem.
Ricardo C. CorrêaPublished in: Parallel Comput. (2000)
Keyphrases
- scheduling problem
- polynomial time approximation
- identical machines
- distributed memory
- parallel machines
- np hard
- single processor
- multiprocessor systems
- single machine
- flowshop
- permutation flowshop
- approximation schemes
- tabu search
- approximation algorithms
- randomized approximation
- database machines
- error bounds
- total tardiness
- approximation error
- precedence constraints
- parallel processing
- parallel programming
- multithreading
- sequence dependent setup times
- massively parallel
- parallel implementation
- message passing interface
- shared memory
- processing times
- highly parallel
- genetic algorithm
- minimizing makespan
- greedy algorithm
- model based predictive control