Skip to main content
SpringerLink
Log in

Dynamic cellular manufacturing system design considering alternative routing and part operation tradeoff using simulated annealing based genetic algorithm

  • Published:
Sādhanā Aims and scope Submit manuscript

Abstract

In this paper, an integrated mathematical model of multi-period cell formation and part operation tradeoff in a dynamic cellular manufacturing system is proposed in consideration with multiple part process route. This paper puts emphasize on the production flexibility (production/subcontracting part operation) to satisfy the product demand requirement in different period segments of planning horizon considering production capacity shortage and/or sudden machine breakdown. The proposed model simultaneously generates machine cells and part families and selects the optimum process route instead of the user specifying predetermined routes. Conventional optimization method for the optimal cell formation problem requires substantial amount of time and memory space. Hence a simulated annealing based genetic algorithm is proposed to explore the solution regions efficiently and to expedite the solution search space. To evaluate the computability of the proposed algorithm, different problem scenarios are adopted from literature. The results approve the effectiveness of the proposed approach in designing the manufacturing cell and minimization of the overall cost, considering various manufacturing aspects such as production volume, multiple process route, production capacity, machine duplication, system reconfiguration, material handling and subcontracting part operation.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6

Similar content being viewed by others

References

  1. Selim H, Askin R and Vakharia A 1998 Cell formation in group technology: Review, evaluation and directions for future research. Comput. Ind. Eng. 34(1): 3–20

    Article  Google Scholar 

  2. Hu L and Yasuda K 2006 Minimizing material handing cost in cell formation with alternative processing routes by grouping genetic algorithm. Int. J. Prod. Res. 44: 2133–2167

    Article  MATH  Google Scholar 

  3. Wemmerlov U and John D 1997 Cellular manufacturing at 46 user plants: Implementation experiences and performance improvements. Int. J. Prod. Res. 35(1): 29–49

    Article  MATH  Google Scholar 

  4. Rheault M, Drolet J and Abdulnour G 1995 Physically reconfigurable virtual cells: A dynamic model for a highly dynamic environment. Comput. Ind. Eng. 29(1–4): 221–225

    Article  Google Scholar 

  5. Kusiak A 1987 The generalized group technology concept. Int. J. Prod. Res. 43: 4035–4047

    Google Scholar 

  6. Mansuri S A, Husseini S M and Newman S T 2000 A review of the modern approaches to multi-criteria cell design. Int. J. Prod. Res. 38: 1201–1218

    Article  MATH  Google Scholar 

  7. King J R 1980 Machine component grouping in production flow analysis: An approach using a rank order clustering algorithm. Int. J. Prod. Res. 18(2): 213–232

    Article  Google Scholar 

  8. Singh N 1993 Design of cellular manufacturing systems: An invited review. Eur. J. Oper. Res. 69(3): 284–291

    Article  Google Scholar 

  9. Kusiak A and Cheng C 1990 A branch and bound algorithm for solving the group technology problem. Ann. Oper. Res. 26(1–4): 415–431

    MathSciNet  MATH  Google Scholar 

  10. Askin R G and Standridge C R 1993 Modeling and analysis of manufacturing systems. New York: Wiley

    MATH  Google Scholar 

  11. Logendran R, Ramakrishna P and Srikandarajah C 1994 Tabu search-based heuristics for cellular manufacturing systems in the presence of alternative process plans. Int. J. Prod. Res. 32(2): 273–297

    Article  MATH  Google Scholar 

  12. Arbib C, Lucertini M and Nicolo F 1990 Workload balance and part transfer minimization in flexible manufacturing system. Int. J. Flexible Manuf. Syst. 3: 5–25

    Article  Google Scholar 

  13. Gupta T and Seifoddini H 1990 Production data based similarity coefficient for machine component grouping decision in the design of a cellular manufacturing system. Int. J. Prod. Res. 28(7): 1247–1269

    Article  Google Scholar 

  14. Nagi R, Harhalakis G and Proth J 1990 Multiple routings and capacity considerations in group technology applications. Int. J. Prod. Res. 28(12): 2243–2257

    Article  Google Scholar 

  15. Sankaran S and Kasilingam G 1990 An integrated approach to cell formation and part routing in group technology manufacturing systems. Eng. Optim. 16: 235–245

    Article  Google Scholar 

  16. Adil G, Rajamani D and Strong D 1996 Cell formation considering alternate routings. Int. J. Prod. Res. 34(5): 1361–1380

    Article  MATH  Google Scholar 

  17. Gupta Y, Gupta M, Kumar A and Sundaram C 1996 A genetic algorithm based approach to cell composition and layout design problems. Int. J. Prod. Res. 34(2): 447–482

    Article  MATH  Google Scholar 

  18. Lee M K, Luong H S and Abhary K 1997 A genetic algorithm based cell design considering alternative routing. Comput. Integ. Manuf. Syst. 10(2): 93–108

    Article  Google Scholar 

  19. Askin R, Selim H and Vakharia A 1997 A methodology for designing flexible cellular manufacturing systems. IIE Trans. 29(7): 599–610

    Google Scholar 

  20. Sofianopoulou S 1999 Manufacturing cells design with alternative process plans and/or replicate machines. Int. J. Prod. Res. 37(3):707–720

    Article  MATH  Google Scholar 

  21. Mungwattana A 2000 Design of cellular manufacturing system for dynamic and uncertain production requirement with presence of routing flexibility. PhD thesis, Vargina Polytechnic Institute and State University, Blackburg, VA

  22. Zhao C and Wu Z 2000 A genetic algorithm for manufacturing cell formation with multiple routes and multiple objectives. Int. J. Prod. Res. 38(2): 385–395

    Article  MATH  Google Scholar 

  23. Chan W M, Chan C Y and Ip W H 2002 A heuristic algorithm for machine assignment in cellular layout. Comput. Ind. Eng. 44: 49–73

    Article  Google Scholar 

  24. Chen M and Cao D 2004 Coordinating production planning in cellular manufacturing environment using tabu search. Comput. Ind. Eng. 46: 571–588

    Article  Google Scholar 

  25. Tavakkoli-Moghaddam R, Aryanezhad M B, Safaei N and Azaron A 2005a Solving a dynamic cell formation problem using meta-heuristics. Appl. Math. Comput. 170: 761–780

    MathSciNet  MATH  Google Scholar 

  26. Tavakkoli-Moghaddam R, Safaei N and Babakhani M 2005b Solving a dynamic cell formation problem with machine cost and alternative process plan by memetic algorithm. In: O B Lupanov, O M Kasim-Zade, A V Chaskin and K Steinhofel (eds) Lecture notes in computer science, vol. 3777. Berlin: Springer, 213–227

    Google Scholar 

  27. Tavakkoli-Moghaddam R, Javadian N, Javadi B and Safaei N 2006 Design of facility layout problem in cellular manufacturing system with stochastic demands. Appl. Math. Comput. 184: 721–728

    MathSciNet  MATH  Google Scholar 

  28. Nsakanda A L, Diaby M and Price W L 2006 Hybrid genetic approach for solving large scale capacitated cell formation problems with multiple routings. Eur. J. Oper. Res. 171: 1051–1070

    Article  MATH  Google Scholar 

  29. Defersha F M and Chen M 2006a A comprehensive mathematical model for the design of cellular manufacturing systems. Int. J. Prod. Econ. 103: 767–783

    Article  Google Scholar 

  30. Ahkioon S, Bulgak A A and Bektas T 2007 Integrated cellular manufacturing system design with production planning and dynamic system reconfiguration. Eur. J. Oper. Res. 192: 414–428

    Article  MathSciNet  MATH  Google Scholar 

  31. Defersha F M and Chen M 2008 A parallel genetic algorithm for dynamic cell formation in cellular manufacturing systems. Int. J. Prod. Res. 46(22): 6389–6413

    Article  MATH  Google Scholar 

  32. Defersha F M and Chen M 2006b Machine cell formation using a mathematical model and a genetic algorithm based heuristic. Int. J. Prod. Res. 44: 2421–2444

    Article  MATH  Google Scholar 

  33. Safaei N, Saidi-Mehrabad M and Jabal-Ameli M S 2008 A hybrid simulated annealing for solving an extended model of dynamic cellular manufacturing system. Eur. J. Oper. Res. 185(2): 563–592

    Article  MATH  Google Scholar 

  34. Ahkioon S, Bulgak A A and Bektas T 2009 Cellular manufacturing system design with routing flexibility, machine procurement, production planning and dynamic system reconfiguration. Int. J. Prod. Res. 47(6): 1573–1600

    Article  MATH  Google Scholar 

  35. Kioon S-A, Bulgak A-A, Bektas T 2009 Integrated cellular manufacturing system design with production planning and dynamic system reconfiguration. Eur. J. Oper. Res. 192: 414–428

    Article  MathSciNet  MATH  Google Scholar 

  36. Safaei N and Tavakkoli-Moghaddam R 2009 Integrated Multi-period cell formation and subcontracting production planning in dynamic cellular manufacturing systems. Int. J. Prod. Econ. 120(2): 301–314

    Article  MathSciNet  Google Scholar 

  37. Tunnukij T and Hicks C 2009 An enhanced grouping genetic algorithm for solving the cell formation problem. Int. J. Prod. Res. 47(7): 1989–2007

    Article  Google Scholar 

  38. Ozcelik F and Sarac T 2011 A genetic algorithm extended modified sub-gradient algorithm for cell formation problem with alternative routings, Int. J. Prod. Res. doi:10.1080/00207543.2011.588264

    Google Scholar 

  39. Solimanpur M and Foroughi V 2011 A new approach to the cell formation problem with alternative processing routes and operation sequence. Int. J. Prod. Res. 49(19): 5833–5849

    Article  Google Scholar 

  40. Saidi-Mehrabad M, Mahdi Paydar M and Aalaei A 2013 Production planning and worker training in dynamic manufacturing systems. J. Manuf. Syst. 32: 308–314

    Article  Google Scholar 

  41. Brown D, Huntley C and Spillane A 1989 A parallel genetic heuristic for the quadratic assignment problem. In: Proceedings of 3rd international conference on genetic algorithm, 406–415

  42. Goldberg D E 1989 Genetic algorithms in search, optimization, and machine learning. Reading, MA: Addision-wesley

    MATH  Google Scholar 

  43. Deep K and Singh P K 2013 Machine cell formation: Using genetic algorithm based heuristic considering alternative route. Int. J. Oper. Res. 24(1): 83–101

    Article  MathSciNet  Google Scholar 

  44. Wicks E 1995 Designing cellular manufacturing systems with time varying product mix and resource availability. PhD thesis, Virginia Polytechnic Institute and State University, Blacksburg, VA

  45. Wicks E M and Reasor R J 1999 Designing cellular manufacturing systems with dynamic part populations. IIE Trans. 31: 11–20

    Google Scholar 

  46. Jayakumar V and Raju R 2010 An adaptive cellular manufacturing system design with routing flexibility and dynamic system reconfiguration. Eur. J. Sci. Res. 47(4): 595–611

    Google Scholar 

  47. LINDO system Inc. 2005 Extended Lingo; Trial version + User Guide. Chicago: LINDO System Inc.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mechanical Engineering, Guru Jambheshwar University of Science and Technology, Hisar, 125001, India

    Kamal Deep

  2. Department of Mechanical Engineering, Sant Longowal Institute of Engineering and Technology, Longowal, 148106, India

    Pardeep K Singh

Authors
  1. Kamal Deep
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pardeep K Singh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kamal Deep.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Deep, K., Singh, P.K. Dynamic cellular manufacturing system design considering alternative routing and part operation tradeoff using simulated annealing based genetic algorithm. Sādhanā 41, 1063–1079 (2016). https://doi.org/10.1007/s12046-016-0530-7

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12046-016-0530-7

Keywords

Search

Navigation