A cell formation algorithm: Hypergraph approximation -- cut tree

DOI10.1016/S0377-2217(97)00143-4MaRDI QIDQ1303737zbMATH OpenFDO

Authors Levent Kandiller

Publication date 16 September 1999

Published in European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

graph theorymodelinghypergraphsmanufacturingcell formation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Production models (90B30)

Recommendations

• A new cut-based genetic algorithm for graph partitioning applied to cell formation
• An exact model for cell formation in group technology
• An optimal tree search method for the manufacturing systems cell formation problem
• Finding part-machine families using graph partitioning techniques
• Designing cellular manufacturing systems by a truncated tree search

Cites work

• scientific article; zbMATH DE number 49142 (Why is no real title available?)
• scientific article; zbMATH DE number 176481 (Why is no real title available?)
• scientific article; zbMATH DE number 177817 (Why is no real title available?)
• scientific article; zbMATH DE number 3522018 (Why is no real title available?)
• A Review of the Placement and Quadratic Assignment Problems
• A comparative study of cell formation in cellular manufacturing systems
• An ideal seed non-hierarchical clustering algorithm for cellular manufacturing
• Equivalence of Memory to “Random Logic”
• Multi-Terminal Network Flows
• On an optimization problem occurring in FMSs: A hypergraph-theoretical formulation
• ZODIAC—an algorithm for concurrent formation of part-families and machine-cells

Cited in

(2)

• Some underlying mathematical definitions and principles for cellular manufacturing
• A new cut-based genetic algorithm for graph partitioning applied to cell formation

This page was built for publication: A cell formation algorithm: Hypergraph approximation -- cut tree

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