An improved branch-and-bound algorithm for the two machine total completion time flow shop problem.
Federico Della CroceMarco GhirardiRoberto TadeiPublished in: Eur. J. Oper. Res. (2002)
Keyphrases
- flowshop
- branch and bound algorithm
- scheduling problem
- np hard
- completion times
- precedence constraints
- job processing times
- single machine scheduling problem
- strongly np hard
- lower bound
- sequence dependent setup times
- special case
- branch and bound
- upper bound
- optimal solution
- shortest processing time
- lower bounding
- setup times
- flowshop scheduling
- test problems
- processing times
- minimizing makespan
- lagrangian relaxation
- single machine
- combinatorial optimization
- upper bounding
- maximum lateness
- asymptotic optimality
- tabu search
- np complete
- parallel machines
- release dates
- unrelated parallel machines
- lot streaming
- finding an optimal solution
- worst case
- neural network