Abstract
This paper considers the cell formation problem in which alternative process plans exist for each part. A three-stage algorithm decomposing the original problem into three subproblems, i.e., process plan selection, parts assignment, and machines assignment problems, respectively, is proposed to solve this problem. Test problems, both from the literature and those generated in this study, are used to evaluate the performance of the proposed algorithm. The proposed algorithm can very efficiently find good-quality solutions and should thus be useful to practitioners and researchers.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aljaber N, Baek W, Chen C-L (1997) A tabu search approach to the cell formation problem. Comput Ind Eng 32:169–185
Chen CH (1992) Algorithms for grouping machines groups in group technology. Omega 20:493–501
Chu CH (1989) Cluster analysis in manufacturing cellular formation. Omega 17:289–295
Glover F (1989) Tabu search – Part I. ORSA J Comput 1:190–206
Glover F (1989) Tabu search – Part II. ORSA J Comput 2:4–32
Glover F, Laguna M (1997) Tabu search. Kluwer, Boston
Hwang H, Ree P (1996) Routes selection for the cell formation problem with alternative part process plans. Comput Ind Eng 30:423–431
Kusiak A (1987) The generalized group technology concept. Int J Prod Res 25:561–569
Logendran R, Ramakrishna P, Sriskandarajah C (1994) Tabu search-based heuristics for cellular manufacturing systems in the presence of alternative process plans. Int J Prod Res 32:273–297
McAuley J (1972) Machine grouping for efficient production.Prod Eng 51:53–57
Nagi R, Harlarakis G, Proth JM (1990) Multiple routeings and capacity considerations in group technology applications. Int J Prod Res 28: 2243–2257
Rolland E, Schilling DA, Current JR (1996) An efficient tabu search procedure for the p-Median problem. Eur J Oper Res 96:329–342
Sankaran S, Kasilingam KG (1990) An integrated approach to cell formation and part routing in group technology. Eng Optim 16:235–245
Sun M, Aronson JE, McKeown PG, Drinka D (1998) A tabu search heuristic procedure for the fixed charge transportation problem. Eur J Oper Res 106:441–456
Won Y, Kim S (1994) An assignment method for the part-machine cell formation problem in the presence of multiple process routes. Eng Optim 22:231–240
Won Y, Kim S (1997) Multiple criteria clustering algorithm for solving the group technology problem with multiple process routings.Comput Ind Eng 32:207–220
Wu T-H, Low C, Wu W-T (2004) A tabu search approach for the cell formation problem. Int J Adv Manuf Technol (Published online: 27 March 2004)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Wu, TH., Chen, JF. & Yeh, JY. A decomposition approach to the cell formation problem with alternative process plans. Int J Adv Manuf Technol 24, 834–840 (2004). https://doi.org/10.1007/s00170-003-1749-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-003-1749-0