Minimizing Makespan and Preemption Costs on a System of Uniform Machines.
Hadas ShachnaiTami TamirGerhard J. WoegingerPublished in: Algorithmica (2005)
Keyphrases
- minimizing makespan
- parallel machines
- flowshop
- scheduling problem
- total flowtime
- precedence constraints
- sequence dependent setup times
- setup times
- shared memory
- release dates
- special case
- expected cost
- lot sizing
- processing times
- completion times
- parallel computing
- learning machines
- total cost
- np hard
- single machine
- upper bound
- search space