A heuristic algorithm for machine assignment in cellular layout

Authors:
W. M. Chan;C. Y. Chan;W. H. Ip
Affiliations:
Department of Industrial and Systems Engineering, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, People's Republic of China;Department of Industrial and Systems Engineering, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, People's Republic of China;Department of Industrial and Systems Engineering, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, People's Republic of China
Venue:
Computers and Industrial Engineering
Year:
2003

Citing 3
Cited 4

A layout planning systems with multiple criteria and a variable domain representation

Management Science
Machine layout problem in flexible manufacturing systems

Operations Research
Genetic search and the dynamic facility layout problem

Computers and Operations Research - Special issue: heuristic, genetic and tabu search

Facility layout using weighted association rule-based data mining algorithms: Evaluation with simulation

Expert Systems with Applications: An International Journal
Design of robust layout for Dynamic Plant Layout Problems

Computers and Industrial Engineering
A meta-heuristic approach for cell formation problem

Proceedings of the Second Symposium on Information and Communication Technology
Agility and production flow layouts: An analytical decision analysis

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

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.