A branch-and-bound approach to minimise the value-at-risk of the makespan in a stochastic two-machine flow shop.
Lei LiuMarcello UrgoPublished in: Int. J. Prod. Res. (2024)
Keyphrases
- branch and bound
- scheduling problem
- lower bound
- processing times
- optimal solution
- branch and bound algorithm
- upper bound
- search algorithm
- column generation
- single machine
- np hard
- search space
- randomly generated problems
- flowshop
- combinatorial optimization
- branch and bound method
- branch and bound search
- network design problem
- tree search
- branch and bound procedure
- lagrangian heuristic
- depth first search
- beam search
- search strategies
- linear programming relaxation
- lower and upper bounds
- tree search algorithm
- monte carlo
- special case
- integer programming problems
- max sat
- partial solutions