A scheduling problem for several parallel servers.
Klaus SchiefermayrJosef WeichboldPublished in: Math. Methods Oper. Res. (2007)
Keyphrases
- scheduling problem
- parallel machines
- single machine
- np hard
- minimizing makespan
- flowshop
- identical machines
- tabu search
- parallel processing
- parallel implementation
- permutation flowshop
- load balance
- parallel computation
- precedence constraints
- unrelated parallel machines
- databases
- total tardiness
- parallel programming
- setup times
- processing times
- massively parallel
- distributed memory
- data center
- objective function