A Branch-and-Bound Algorithm to Minimize the Makespan in a Flowshop with Blocking.
Débora P. RonconiPublished in: Ann. Oper. Res. (2005)
Keyphrases
- branch and bound algorithm
- flowshop
- scheduling problem
- np hard
- lower bound
- flowshop scheduling
- branch and bound
- special case
- strongly np hard
- optimal solution
- upper bound
- processing times
- minimizing makespan
- bicriteria
- setup times
- maximum lateness
- flowshop scheduling problems
- single machine
- precedence constraints
- preventive maintenance
- sequence dependent setup times
- tabu search
- combinatorial optimization
- lower bounding
- single machine scheduling problem
- finding an optimal solution
- upper bounding
- approximation algorithms
- lagrangian relaxation
- release dates
- column generation
- np complete
- worst case
- search algorithm
- lower and upper bounds
- linear programming
- permutation flowshop
- evolutionary algorithm
- feasible solution
- knapsack problem