A new branch and bound algorithm for cell formation problem

DOI10.1016/j.apm.2011.12.047zbMath1252.90018OpenAlexW1972134807MaRDI QIDQ693667

Hadi Abdollahzadeh, Jamal Arkat, Homa Ghahve

Publication date: 7 December 2012

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2011.12.047

zbMATH Keywords

branch and bound algorithmcell formation problemproblem-oriented branching scheme

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Production models (90B30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The evolution of cell formation problem methodologies based on recent studies (1997-2008): Review and directions for future research
• An optimal tree search method for the manufacturing systems cell formation problem
• Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
• A projection technique for partitioning the nodes of a graph
• A new branch and bound-enhanced genetic algorithm for the manufacturing cell formation problem
• CASE: A clustering algorithm for cell formation with sequence data
• Multi-objective machine-part cell formation through parallel simulated annealing
• Solving the Generalized Machine Assignment Problem in Group Technology

This page was built for publication: A new branch and bound algorithm for cell formation problem