Enhanced lower bounds and exact procedures for total completion time minimization in a two-machine permutation flowshop with release dates.
Mehdi MradSabrine ChalghoumiTalel LadhariAnis GharbiPublished in: Int. Trans. Oper. Res. (2019)
Keyphrases
- strongly np hard
- permutation flowshop
- release dates
- scheduling problem
- sequence dependent setup times
- lower bound
- single machine
- flowshop
- single machine scheduling problem
- precedence constraints
- processing times
- np hard
- branch and bound algorithm
- parallel machines
- setup times
- objective function
- upper bound
- tabu search
- branch and bound
- optimal solution
- lower and upper bounds
- approximation algorithms
- setup cost
- message passing
- special case
- evolutionary algorithm