ZODIAC—an algorithm for concurrent formation of part-families and machine-cells (Q3762054)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4012291
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | ZODIAC—an algorithm for concurrent formation of part-families and machine-cells |
scientific article; zbMATH DE number 4012291 |
Statements
ZODIAC—an algorithm for concurrent formation of part-families and machine-cells (English)
0 references
1987
0 references
part-families
0 references
machine-cells
0 references
group technology
0 references
ideal seed algorithm
0 references
clustering
0 references
0.79425013
0 references
0.7825957
0 references
0.77521485
0 references
0.7633503
0 references
0.7582104
0 references
This paper deals with the development of an algorithm for concurrent formulation of part-families and machine-cells in group technology. The acronym ZODIAC stands for zero-one data: ideal seed algorithm for clustering. The present algorithm is an expanded and improved version of the earlier ideal seed method. The formation of part-families and machine-cells has been treated as a problem of block diagonalization of the zero-one matrix. Different methods of choosing seeds have been developed and tested. A new concept called 'relative efficiency' has been developed and used as a stopping rule for the iterations. The ZODIAC procedure and its theory are given in detail. Test results with a 40\(\times 100\) matrix are shown.
0 references