Analyzing Branch-and-Bound Algorithms for the Multiprocessor Scheduling Problem.
Thomas LivelyWilliam LongArtidoro PagnoniPublished in: CoRR (2019)
Keyphrases
- branch and bound algorithm
- scheduling problem
- np hard
- precedence constraints
- lower bound
- branch and bound
- randomly generated
- optimal solution
- upper bound
- single machine
- combinatorial optimization
- set covering problem
- single machine scheduling problem
- flowshop
- finding an optimal solution
- strongly np hard
- search tree
- sequence dependent setup times
- setup times
- variable ordering
- boolean satisfiability
- special case
- tabu search
- combinatorial problems
- approximation algorithms
- linear programming
- lagrangian relaxation
- processing times
- integer programming
- haplotype inference
- release dates
- computational complexity
- search algorithm
- neural network