Principal component analysis for evaluating the feasibility of cellular manufacturing without initial machine-part matrix clustering
From MaRDI portal
Publication:4394324
DOI10.1080/00207549408957050zbMath0896.90108OpenAlexW1997123558MaRDI QIDQ4394324
Publication date: 11 June 1998
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207549408957050
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The concept of parsimony in factor analysis
- A close neighbour algorithm for designing cellular manufacturing systems
- Seed selection procedures for cell formation heuristics
- An ideal seed non-hierarchical clustering algorithm for cellular manufacturing
- ZODIAC—an algorithm for concurrent formation of part-families and machine-cells
- A polynomial algorithm for the min-cut linear arrangement of trees
- A Clustering and Data-Reorganizing Algorithm
- The Shortest Hamiltonian Chain of a Graph
- Problem Decomposition and Data Reorganization by a Clustering Technique
- Technical Note—Bounds for the Travelling-Salesman Problem
This page was built for publication: Principal component analysis for evaluating the feasibility of cellular manufacturing without initial machine-part matrix clustering