A new branch and bound algorithm for cell formation problem

DOI10.1016/J.APM.2011.12.047zbMATH Open1252.90018OpenAlexW1972134807MaRDI QIDQ693667FDOQ693667

Authors: Jamal Arkat, Hadi Abdollahzadeh, 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

Recommendations

• A new branch and bound-enhanced genetic algorithm for the manufacturing cell formation problem
• A Branch and Bound Algorithm for a Fractional 0-1 Programming Problem
• Incremental cell formation considering alternative machines
• Manufacturing cell formation by state-space search
• An algorithm for the cell formation and the machine selection problems in the design of a cellular manufacturing system

zbMATH Keywords

branch and bound algorithmcell formation problemproblem-oriented branching scheme

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• A new branch and bound-enhanced genetic algorithm for the manufacturing cell formation problem
• Multi-objectives for incremental cell formation problem
• A Computational Study of the Pseudo-Boolean Approach to the p-Median Problem Applied to Cell Formation
• Two-phase approach to GT cell formation using efficient p-median formulations

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q693667)