1998
DOI: 10.1080/002075498193985
|View full text |Cite
|
Sign up to set email alerts
|

CASE: A clustering algorithm for cell formation with sequence data

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

4
89
0

Year Published

2008
2008
2018
2018

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 139 publications
(93 citation statements)
references
References 0 publications
4
89
0
Order By: Relevance
“…Total number of 1 s outside the diagonal block in clustered matrix, N 0 in is the Total number of 0 s inside the diagonal block of clustered matrix (Albadawi et al 2005;Nair and Narendran 1998;Sarker 1996;Wang 2003). GI ?…”
Section: Comparison Of Results Of Clustering Algorithm Usedmentioning
confidence: 99%
See 1 more Smart Citation
“…Total number of 1 s outside the diagonal block in clustered matrix, N 0 in is the Total number of 0 s inside the diagonal block of clustered matrix (Albadawi et al 2005;Nair and Narendran 1998;Sarker 1996;Wang 2003). GI ?…”
Section: Comparison Of Results Of Clustering Algorithm Usedmentioning
confidence: 99%
“…grouping efficiency: It incorporates both machine utilization and inter-cell movement. It is defined as the sum of two weighted functions, one for machine utilization and other for inter-cell movement with a weight factor; recommendation is in favour of equal weight for both functions (Chandrasekharan and Rajagopalan 1986;Nair and Narendran 1998;Sarker 1996;Wang 2003).…”
Section: Comparison Of Results Of Clustering Algorithm Usedmentioning
confidence: 99%
“…To extend the generalized similarity by Won and Kim [25], Yin and Yasuda [26] developed the formulation of sequence ratio (SR) that compares the actual and theoretically highest intermachine movements between two machines. Nair and Narendran [3] focused on the intermediate operations that will incur two intercell movements as compared to the first and last operations. This similarity notion was also adopted by Won and Lee [27].…”
Section: Similarity Coefficients In Cfmentioning
confidence: 99%
“…Particularly, if an operation is in the middle and the relevant part and machine are not in the same cell, this part needs to move out and then move in with respect to its own cell (i.e., 2 times). Let = [ ] be the weighted sequence matrix [3] to capture this idea, and it is defined as follows:…”
Section: Measures Of Solution Qualitymentioning
confidence: 99%
“…In this regard, many models and solution approaches have been developed to identify machine cells and part families. These approaches can be classified into three main categories [4]: 1) mathematical programming (MP) models [5][6][7][8], 2) heuristic/meta-heuristic solution algorithms [9][10][11], and 3) similarity coefficient methods (SCM) [12,13].…”
Section: Introductionmentioning
confidence: 99%