1987
DOI: 10.1080/00207548708919880
|View full text |Cite
|
Sign up to set email alerts
|

ZODIAC—an algorithm for concurrent formation of part-families and machine-cells

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
80
0

Year Published

2000
2000
2018
2018

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 360 publications
(88 citation statements)
references
References 9 publications
2
80
0
Order By: Relevance
“…By applying the proposed method, a solution is obtained and represented in Figure 9, where the parts' demands are shown on the last row. The grouping efficacy of this solution is 0.8403, which matches the result in Chandrasekharan and Rajagopalan [56] and other recent results [7,39]. Also, the execution time of this problem is less than 0.5 second based on Matlab implementation using a typical computer (speed: 3.1 GHz, RAM: 8 GB).…”
Section: Three Examples To Examine the Basic Functionalitysupporting
confidence: 86%
See 1 more Smart Citation
“…By applying the proposed method, a solution is obtained and represented in Figure 9, where the parts' demands are shown on the last row. The grouping efficacy of this solution is 0.8403, which matches the result in Chandrasekharan and Rajagopalan [56] and other recent results [7,39]. Also, the execution time of this problem is less than 0.5 second based on Matlab implementation using a typical computer (speed: 3.1 GHz, RAM: 8 GB).…”
Section: Three Examples To Examine the Basic Functionalitysupporting
confidence: 86%
“…The third example comes from Chandrasekharan and Rajagopalan [56], which was originally a CF problem of 40 machines and 100 parts with binary information only. To examine the handling of sequence and demand information, the operation sequence is generated for each part based on the order of the machine indices (a method used by Spiliopoulos and Sofianopoulou [57]).…”
Section: Three Examples To Examine the Basic Functionalitymentioning
confidence: 99%
“…Both the single linkage clustering algorithm and the average clustering algorithm are hierarchical clustering algorithms. The only known non-hierarchical clustering reported so far include the MacQueen's k-means method [14] which requires the number of clusters to be specified in advance, the ideal-seed algorithm [15] and its improved version ZODIAC [16].…”
Section: Machine Cell Formation Techniquesmentioning
confidence: 99%
“…The efficiency ranges from 0 to 1. Group efficiency has been reported has a lower discriminating power (Chandrasekharan & Rajagopalan, 1987). Even an extremely bad solution with large number of exceptional elements has an efficiency value as high as 0.77.…”
Section: Grouping Efficiencymentioning
confidence: 99%