Minimizing Makespan and Preemption Costs on a System of Uniform Machines.
Hadas ShachnaiTami TamirGerhard J. WoegingerPublished in: ESA (2002)
Keyphrases
- minimizing makespan
- parallel machines
- scheduling problem
- flowshop
- total flowtime
- sequence dependent setup times
- precedence constraints
- parallel computing
- setup times
- single server
- release dates
- processing times
- lot sizing
- shared memory
- cost savings
- np hard
- special case
- pairwise
- single machine
- completion times
- total cost
- tabu search
- simulated annealing
- flowshop scheduling