A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines.
Tomás EbenlendrJirí SgallPublished in: WAOA (2008)
Keyphrases
- parallel machines
- lower bound
- unrelated parallel machines
- scheduling problem
- upper bound
- total tardiness
- sequence dependent setup times
- minimize total
- precedence constraints
- weighted tardiness
- earliness tardiness
- release dates
- np hard
- scheduling jobs
- makespan minimization
- identical parallel machines
- total weighted tardiness
- setup times
- branch and bound algorithm
- maximum lateness
- list scheduling
- branch and bound
- decision making
- parallel computing
- decision makers
- optimal solution
- lower and upper bounds
- objective function
- worst case
- strongly np hard
- shared memory
- flowshop
- single server
- open shop
- lot sizing
- competitive ratio
- processing times
- job shop scheduling
- lagrangian relaxation
- identical machines
- message passing
- single machine
- feasible solution
- optimization problems
- pairwise