Branch-and-bound approach for optima localization in scheduling multiprocessor jobs.
Alexander V. KononovPolina A. KononovaAlexander GordeevPublished in: Int. Trans. Oper. Res. (2020)
Keyphrases
- branch and bound
- branch and bound algorithm
- precedence constraints
- optimal solution
- scheduling algorithm
- release dates
- identical parallel machines
- identical machines
- parallel machines
- lower bound
- job scheduling
- search algorithm
- scheduling policies
- single machine scheduling problem
- scheduling problem
- minimize total
- computational grids
- search space
- processing times
- column generation
- combinatorial optimization
- upper bound
- wafer fabrication
- randomly generated problems
- branch and bound method
- branch and bound procedure
- batch processing
- evolutionary algorithm
- np hard
- search tree
- multiprocessor systems
- integer programming problems
- tree search
- single machine
- parallel processors
- search strategies
- linear programming
- linear programming relaxation
- network design problem
- flowshop
- metaheuristic
- branch and bound search
- beam search
- knapsack problem
- tree search algorithm
- lagrangian heuristic
- simulated annealing
- max sat
- objective function
- feasible solution
- linear program