Lower Bounds with Smaller Domain Size On Concurrent Write Parallel Machines.
Jeff EdmondsPublished in: Computational Complexity Conference (1991)
Keyphrases
- parallel machines
- lower bound
- scheduling problem
- upper bound
- total tardiness
- branch and bound algorithm
- precedence constraints
- np hard
- massively parallel
- weighted tardiness
- sequence dependent setup times
- minimize total
- parallel computing
- unrelated parallel machines
- setup times
- lower and upper bounds
- higher order
- vc dimension
- single server
- shared memory
- lot sizing
- release dates
- flowshop
- read write
- worst case
- computational complexity
- optimal solution