A genetic-algorithm-based heuristic for the GT cell formation problem

Cited 19 time in webofscience Cited 0 time in scopus
  • Hit : 225
  • Download : 0
This paper presents a heuristic for the machine-part grouping problem which incorporates relevant production requirements such as routing sequence, production volume, unit handling size, unit processing time and cell size. The heuristic consists of two phases. The first phase is developed based on a genetic algorithm and greedy heuristic to solve the machine grouping problem. Once machine cells are identified, the second phase is employed to identify the associated part families. The performance of the heuristic is examined through a comparative study with some existing solution methods. Global efficiency, group efficiency, intercell move factor and grouping effectiveness are adopted as comparative measures. Copyright (C) 1996 Elsevier Science Ltd
Publisher
PERGAMON-ELSEVIER SCIENCE LTD
Issue Date
1996-09
Language
English
Article Type
Article; Proceedings Paper
Keywords

GROUP TECHNOLOGY; CLUSTERING-ALGORITHM; MANUFACTURING SYSTEM; DESIGN

Citation

COMPUTERS INDUSTRIAL ENGINEERING, v.30, no.4, pp.941 - 955

ISSN
0360-8352
DOI
10.1016/0360-8352(96)00044-7
URI
http://hdl.handle.net/10203/69217
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 19 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0