An exact model for cell formation in group technology

DOI10.1007/S10287-012-0146-2zbMath1273.05177OpenAlexW2136012316MaRDI QIDQ373207

Dmitry Krushinsky, Boris I. Goldengorin

Publication date: 21 October 2013

Published in: Computational Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10287-012-0146-2

zbMATH Keywords

cell formationgroup technologyminimum multicut

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

An efficient exact model for the cell formation problem with a variable number of production cells

Cites Work

• A novel approach to determine cell formation, intracellular machine layout and cell layout in the CMS problem based on TOPSIS method
• A new and improved algorithm for the 3-cut problem
• Worst-case analysis of an algorithm for cellular manufacturing
• Stepwise decomposition approaches for large scale cell formation problems
• Approximating \(k\)-cuts using network strength as a Lagrangean relaxation
• Machine-part cell formation in group technology using a modified ART1 method
• A new branch and bound-enhanced genetic algorithm for the manufacturing cell formation problem
• Models for cellular manufacturing systems design: matching processing requirements and operator capabilities
• Machine-component cell formation in group technology: a neural network approach
• CASE: A clustering algorithm for cell formation with sequence data
• A Polynomial Algorithm for the k-cut Problem for Fixed k
• Finding k Cuts within Twice the Optimal
• Problem Decomposition and Data Reorganization by a Clustering Technique

This page was built for publication: An exact model for cell formation in group technology