Scheduling a wet station using a branch and bound algorithm.
Hyun-Jung KimJun-Ho LeeTae-Eog LeePublished in: SMC (2012)
Keyphrases
- branch and bound algorithm
- precedence constraints
- lower bound
- branch and bound
- np hard
- upper bound
- optimal solution
- scheduling problem
- lower bounding
- dominance rules
- test problems
- upper bounding
- combinatorial optimization
- release dates
- randomly generated problems
- mixed integer linear programming
- single machine scheduling problem
- lagrangian relaxation
- branch and bound method
- finding an optimal solution
- sequence dependent setup times
- maximum lateness
- integer variables
- neural network
- setup times
- variable ordering
- special case
- max sat
- lower and upper bounds
- knapsack problem
- resource allocation