A branch and bound algorithm to minimize total tardiness of jobs in a two identical-parallel-machine scheduling problem with a machine availability constraint.
Ju-Yong LeeYeong-Dae KimPublished in: J. Oper. Res. Soc. (2015)
Keyphrases
- parallel machine scheduling problem
- release dates
- minimize total
- branch and bound algorithm
- single machine scheduling problem
- precedence constraints
- sequence dependent setup times
- lower bound
- branch and bound
- maximum lateness
- total weighted tardiness
- single machine
- scheduling problem
- upper bound
- np hard
- optimal solution
- parallel machines
- combinatorial optimization
- setup times
- processing times
- search space
- global constraints
- lagrangian relaxation
- integer programming