A branch-and-bound approach to schedule a no-wait flow shop to minimize the CVaR of the residual work content.
Marcello UrgoPublished in: Comput. Ind. Eng. (2019)
Keyphrases
- branch and bound
- lower bound
- branch and bound algorithm
- search algorithm
- search space
- optimal solution
- upper bound
- beam search
- combinatorial optimization
- column generation
- branch and bound method
- scheduling problem
- randomly generated problems
- branch and bound procedure
- tree search
- tree search algorithm
- network design problem
- integer programming problems
- genetic algorithm
- branch and bound search
- portfolio selection
- completion times
- linear programming relaxation
- depth first search
- max sat
- search strategies
- probabilistic model
- neural network