A polynomial-time algorithm for optimal clustering in a special class of {0, l} -matrices

DOI10.1080/00207549608905046zbMath0929.90033OpenAlexW1977390932MaRDI QIDQ4230254

Dharmaraj Veeramani, Karthik Mani

Publication date: 1 March 1999

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207549608905046

zbMATH Keywords

group technologycellular manufacturingcluster formation heuristicsidentification of clusters

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Production models (90B30)

Related Items (1)

A new value stream mapping approach for complex production systems

Cites Work

• Unnamed Item
• Unnamed Item
• A method for finding minimal bottle-neck cells for grouping part-machine families†
• A Linear–Programming Method for the Combinatorial Grouping of an Incomplete Power Set
• On the Consecutive-Retrieval Problem
• Problem Decomposition and Data Reorganization by a Clustering Technique
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: A polynomial-time algorithm for optimal clustering in a special class of {0, l} -matrices