Lower Bounds for Scheduling on Identical Parallel Machines with Heads and Tails.
Mohamed HaouariAnis GharbiPublished in: Ann. Oper. Res. (2004)
Keyphrases
- identical parallel machines
- lower bound
- competitive ratio
- strongly np hard
- scheduling problem
- scheduling jobs
- upper bound
- fixed number
- branch and bound algorithm
- np hard
- processing times
- online algorithms
- branch and bound
- single machine
- release dates
- worst case
- optimal solution
- parallel machines
- objective function
- average case
- setup times
- single server
- vc dimension
- lagrangian relaxation
- lower and upper bounds
- lower bounding
- sequence dependent setup times
- genetic algorithm
- learning algorithm