A Parametrized Branch-and-Bound Strategy for Scheduling Precedence-Constrained Tasks on a Multiprocessor System.
Jan JonssonKang G. ShinPublished in: ICPP (1997)
Keyphrases
- branch and bound
- lower bound
- search algorithm
- branch and bound algorithm
- optimal solution
- scheduling algorithm
- search space
- search strategies
- upper bound
- column generation
- tree search
- combinatorial optimization
- multiprocessor systems
- network design problem
- branch and bound method
- search strategy
- randomly generated problems
- branch and bound search
- linear programming relaxation
- scheduling problem
- branch and bound procedure
- previously solved
- lagrangian heuristic
- beam search
- linear programming
- objective function
- max sat
- multi objective
- integer programming problems
- tree search algorithm
- bnb adopt
- neural network