1990
DOI: 10.1080/00207549008942689
|View full text |Cite
|
Sign up to set email alerts
|

An assignment model for the part-families problem in group technology

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
50
0

Year Published

1997
1997
2017
2017

Publication Types

Select...
6
4

Relationship

0
10

Authors

Journals

citations
Cited by 233 publications
(50 citation statements)
references
References 10 publications
0
50
0
Order By: Relevance
“…Kusiak's similarity coefficients matrix has been used as input to an assignment niodel [18] to solve disjoint and non-disjoint part families problems. The part grouping problem in GT has been modelled as a linear transportation problem, solved in a two-phase algorithm to approximate the optimal solution [19].…”
Section: Machine Cell Formation Techniquesmentioning
confidence: 99%
“…Kusiak's similarity coefficients matrix has been used as input to an assignment niodel [18] to solve disjoint and non-disjoint part families problems. The part grouping problem in GT has been modelled as a linear transportation problem, solved in a two-phase algorithm to approximate the optimal solution [19].…”
Section: Machine Cell Formation Techniquesmentioning
confidence: 99%
“…Integer programming models have been proposed by Choobineh 20 and Gunasingh and Lashkari 21 . Shtub 22 and Srinivasan et al 23 have modeled the problem as an assignment problem. The CF problem is non-deterministic polynomial (NP) complete problem 24 36 an ant colony optimization approach to form part families and machine groups.…”
Section: Introductionmentioning
confidence: 99%
“…The main purpose is to devise a generalized procedure that would convert, in a finite number of iterations, any original machine-part matrix into a clustered diagonal form, if one exists. Srinivasan et al [9] discussed the similarity coefficient method, which describes that this method is more flexible for incorporating production data, such as production volume, sequence of operation, and operational time, into the machine cell formation. Heuristic algorithms [10,11] have been implemented for many cell formation (CF) solutions.…”
Section: Introductionmentioning
confidence: 99%