Probabilistic advanced reservations for batch-scheduled parallel machines.
Daniel NurmiRichard WolskiJohn BrevikPublished in: PPOPP (2008)
Keyphrases
- parallel machines
- scheduling problem
- total tardiness
- unrelated parallel machines
- precedence constraints
- single machine
- flowshop
- minimize total
- massively parallel
- sequence dependent setup times
- scheduling jobs
- shared memory
- setup times
- parallel computing
- probabilistic model
- weighted tardiness
- bayesian networks
- single server
- tabu search
- processing times
- np hard
- information systems
- open shop
- message passing
- multistage
- simulated annealing
- dynamic programming