A branch and bound algorithm for disassembly scheduling with assembly product structure.
Hwa-Joong KimDong-Ho LeePaul C. XirouchakisO. K. KwonPublished in: J. Oper. Res. Soc. (2009)
Keyphrases
- branch and bound algorithm
- precedence constraints
- lower bound
- branch and bound
- upper bound
- np hard
- optimal solution
- combinatorial optimization
- single machine scheduling problem
- production planning
- randomly generated problems
- mixed integer linear programming
- lower bounding
- max sat
- scheduling algorithm
- constraint satisfaction problems
- lagrangian relaxation
- scheduling problem
- sequence dependent setup times
- multi objective
- branch and bound method
- finding an optimal solution