Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/15162
Title: A heuristic algorithm for machine assignment in cellular layout
Authors: Chan, WM
Chan, CY 
Ip, WH 
Keywords: Cellular facility layout
Cellular machine layout
Cellular manufacturing
Heuristic machine layout
Issue Date: 2003
Publisher: Pergamon Press
Source: Computers and industrial engineering, 2003, v. 44, no. 1, p. 49-73 How to cite?
Journal: Computers and industrial engineering 
Abstract: This paper presents a heuristic algorithm that addresses problems of machine allocation in cellular manufacturing (CM). The focus is on the intra-cell machines allocation, because the inter-cell material flows should be minimal in CM. The algorithm tackles one cell at a time with a maximum of 9 machines, which will be assigned into a 3 × 3 grid space according to the ranking result. The proposed algorithm uses an adoptive approach to relate machines in a cell by examining the merged part flow weights of machine pairs. The establishment of the part flow weight includes practical constrains, such as the part-handling factor and the number of parts per transportation. Then, an objective function is employed to determine the total travelling score in which the travelling distance is covered. The procedures of the proposed heuristic algorithm will be presented in this paper and data used in Yaman's cases are used to illustrate the operation. In comparison to other approaches, the proposed algorithm provided near-optimum layouts.
URI: http://hdl.handle.net/10397/15162
ISSN: 0360-8352
EISSN: 1879-0550
DOI: 10.1016/S0360-8352(02)00184-5
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

24
Last Week
0
Last month
0
Citations as of Aug 14, 2017

WEB OF SCIENCETM
Citations

9
Last Week
0
Last month
0
Citations as of Aug 13, 2017

Page view(s)

38
Last Week
2
Last month
Checked on Aug 13, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.