Lower bounds for parallel machines scheduling.
David SavoureyPhilippe BaptisteAntoine JougletPublished in: RIVF (2006)
Keyphrases
- parallel machines
- lower bound
- scheduling problem
- unrelated parallel machines
- minimize total
- np hard
- upper bound
- sequence dependent setup times
- total tardiness
- release dates
- scheduling jobs
- precedence constraints
- weighted tardiness
- branch and bound algorithm
- massively parallel
- setup times
- parallel computing
- objective function
- single server
- maximum lateness
- branch and bound
- lot sizing
- single machine
- optimal solution
- shared memory
- processing times
- open shop
- search space
- job shop scheduling
- competitive ratio
- flowshop
- identical parallel machines