A Fast Branch-and-Bound Algorithm with an Improved Lower Bound for Solving the Multiprocessor Scheduling Problem.
Satoshi FujitaMasayuki MasukawaShigeaki TagashiraPublished in: ICPADS (2002)
Keyphrases
- branch and bound algorithm
- lower bound
- scheduling problem
- np hard
- precedence constraints
- strongly np hard
- finding an optimal solution
- combinatorial optimization
- upper bound
- variable ordering
- branch and bound
- search algorithm for solving
- dominance rules
- lower bounding
- optimal solution
- single machine scheduling problem
- mixed integer linear programming
- integer variables
- sequence dependent setup times
- exact solution
- single machine
- randomly generated problems
- lagrangian relaxation
- upper bounding
- setup times
- worst case
- flowshop
- objective function
- release dates
- tabu search
- max sat
- lower and upper bounds
- special case
- approximation algorithms
- traveling salesman problem
- branch and bound method
- knapsack problem
- constraint satisfaction problems
- processing times
- cutting plane
- exact methods
- integer programming
- maximum lateness
- linear programming
- metaheuristic
- evolutionary algorithm
- computational complexity
- linear programming relaxation