Scheduling Acyclic Branching Programs on Parallel Machines.
Marius BozgaAbdelkarim KerbaaOded MalerPublished in: RTSS (2004)
Keyphrases
- parallel machines
- scheduling problem
- unrelated parallel machines
- np hard
- minimize total
- sequence dependent setup times
- precedence constraints
- total tardiness
- weighted tardiness
- setup times
- massively parallel
- release dates
- parallel computing
- scheduling jobs
- maximum lateness
- shared memory
- flowshop
- lot sizing
- single machine
- special case
- dynamic programming
- open shop
- higher order
- probabilistic model