A branch-and-bound algorithm for the cell formation problem.
Irina UtkinaMikhail V. BatsynEkaterina K. BatsynaPublished in: Int. J. Prod. Res. (2018)
Keyphrases
- branch and bound algorithm
- cell formation
- lower bound
- branch and bound
- inter cell
- np hard
- manufacturing cell
- manufacturing systems
- optimal solution
- upper bound
- lower bounding
- combinatorial optimization
- layout design
- mixed integer linear programming
- material handling
- lagrangian relaxation
- randomly generated problems
- precedence constraints
- upper bounding
- single machine scheduling problem
- search algorithm
- complex systems
- metaheuristic
- simulated annealing
- finding an optimal solution