Predicting bounds on queuing delay for batch-scheduled parallel machines.
John BrevikDaniel NurmiRichard WolskiPublished in: PPOPP (2006)
Keyphrases
- parallel machines
- scheduling problem
- total tardiness
- unrelated parallel machines
- single machine
- upper bound
- massively parallel
- precedence constraints
- lower bound
- sequence dependent setup times
- minimize total
- flowshop
- np hard
- release dates
- single server
- scheduling jobs
- parallel computing
- setup times
- weighted tardiness
- worst case
- lower and upper bounds
- shared memory
- processing times
- data processing
- information systems
- error bounds
- online algorithms
- single machine scheduling problem
- batch processing
- job shop scheduling problem
- pairwise
- lot sizing
- scheduling algorithm