An exact branch-and-bound algorithm for seru scheduling problems with sequence-dependent setup time.
Xiaohong ZhangZhe ZhangXue GongYong YinPublished in: Soft Comput. (2023)
Keyphrases
- branch and bound algorithm
- scheduling problem
- precedence constraints
- np hard
- branch and bound
- lower bound
- dominance rules
- single machine scheduling problem
- upper bound
- optimal solution
- sequence dependent setup times
- lower bounding
- combinatorial optimization
- randomly generated problems
- single machine
- special case
- mixed integer linear programming
- processing times
- setup times
- flowshop
- release dates
- variable ordering
- maximum lateness
- parallel machines
- column generation
- approximation algorithms
- upper bounding
- strongly np hard
- finding an optimal solution
- exact methods
- completion times
- linear programming relaxation
- max sat
- branch and bound method
- integer variables
- knapsack problem
- genetic algorithm
- neural network