A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines.
Simon DunstallAndrew WirthPublished in: Eur. J. Oper. Res. (2005)
Keyphrases
- scheduling problem
- branch and bound algorithm
- strongly np hard
- identical parallel machines
- np hard
- lower bound
- precedence constraints
- branch and bound
- release dates
- flowshop
- single machine
- processing times
- scheduling jobs
- single machine scheduling problem
- setup times
- upper bound
- special case
- fixed number
- optimal solution
- approximation algorithms
- lower bounding
- parallel machines
- tabu search
- completion times
- combinatorial optimization
- haplotype inference
- objective function
- linear program
- sequence dependent setup times
- np complete
- linear programming