A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property.
Sang-Oh ShimYeong-Dae KimPublished in: Comput. Oper. Res. (2008)
Keyphrases
- branch and bound algorithm
- parallel machine scheduling problem
- single machine scheduling problem
- release dates
- precedence constraints
- sequence dependent setup times
- maximum lateness
- scheduling problem
- total weighted tardiness
- np hard
- lower bound
- branch and bound
- lagrangian relaxation
- upper bound
- optimal solution
- combinatorial optimization
- single machine
- setup times
- parallel machines
- flowshop
- processing times
- linear programming
- worst case
- approximation algorithms