A new branch and bound-enhanced genetic algorithm for the manufacturing cell formation problem

DOI10.1016/J.COR.2005.02.005MaRDI QIDQ2489284zbMATH OpenOpenAlexFDO

Authors Menouar Boulif, Karim Atif

Publication date 16 May 2006

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2005.02.005

zbMATH Keywords

branch and boundGenetic algorithmGraph partitioningManufacturing cell formation

Mathematics Subject Classification ID

Production models (90B30) Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A new branch and bound algorithm for cell formation problem
• A new cut-based genetic algorithm for graph partitioning applied to cell formation
• scientific article; zbMATH DE number 1703853
• A hybrid grouping genetic algorithm for the cell formation problem
• A genetic algorithm for manufacturing cell formation with multiple routes and multiple objectives

Cites work

• A simulated annealing solution to the cell formation problem
• An objective-guided ortho-synapse Hopfield network approach to machine grouping problems
• CASE: A clustering algorithm for cell formation with sequence data
• Cell formation in manufacturing systems through simulated annealing: An experimental evaluation
• Fractional cell formation in group technology
• scientific article; zbMATH DE number 3783030 (Why is no real title available?)
• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• Machine-component cell formation in group technology: a neural network approach
• Manufacturing cell formation in the presence of lot splitting and multiple units of the same machine
• Multi-objective machine-part cell formation through parallel simulated annealing
• Stepwise decomposition approaches for large scale cell formation problems

Cited in

(7)

• Manufacturing cell formation using similarity coefficients and a parallel genetic TSP algorithm: Formulation and comparison
• A new cut-based genetic algorithm for graph partitioning applied to cell formation
• A new fuzzy genetic algorithm for the dynamic bi-objective cell formation problem considering passive and active strategies
• An exact model for cell formation in group technology
• Minimising material handling cost in cell formation with alternative processing routes by grouping genetic algorithm
• A new branch and bound algorithm for cell formation problem
• A novel approach to determine cell formation, intracellular machine layout and cell layout in the CMS problem based on TOPSIS method

This page was built for publication: A new branch and bound-enhanced genetic algorithm for the manufacturing cell formation problem

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