A branch-and-bound algorithm for the two-machine total completion time flowshop problem subject to release dates.
Mohamed Ali RakroukiAnis KooliSabrine ChalghoumiTalel LadhariPublished in: Oper. Res. (2020)
Keyphrases
- release dates
- job processing times
- branch and bound algorithm
- single machine scheduling problem
- precedence constraints
- sequence dependent setup times
- lower bound
- branch and bound
- flowshop
- np hard
- maximum lateness
- scheduling problem
- combinatorial optimization
- optimal solution
- upper bound
- single machine
- makespan minimization
- setup times
- processing times
- lagrangian relaxation
- total weighted tardiness
- completion times
- search algorithm
- constraint satisfaction problems
- neural network
- linear programming