A branch-and-bound algorithm for the solution of chemical production scheduling MIP models using parallel computing.
Sara VelezChristos T. MaraveliasPublished in: Comput. Chem. Eng. (2013)
Keyphrases
- branch and bound algorithm
- parallel computing
- production scheduling
- optimal solution
- lower bound
- branch and bound
- np hard
- lagrangian relaxation
- finding an optimal solution
- computing systems
- feasible solution
- upper bound
- probabilistic model
- complex systems
- simulated annealing
- modeling method
- mixed integer programming
- genetic algorithm