Skip to main content
SpringerLink
Log in

A Branch and Bound Algorithm for the Cell Formation Problem

  • Conference paper
  • First Online:
Models, Algorithms and Technologies for Network Analysis (NET 2014)

Part of the book series: Springer Proceedings in Mathematics & Statistics ((PROMS,volume 156))

Included in the following conference series:

Abstract

The cell formation problem (CFP) is an NP-hard optimization problem considered for cell manufacturing systems. Because of its high computational complexity several heuristics have been developed for solving this problem. In this paper we present a branch and bound algorithm which provides exact solutions of the CFP. This algorithm finds optimal solutions for 13 problems of the 35 popular benchmark instances from the literature.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Askin, R.G., Subramanian, S.P.: A cost-based heuristic for group technology configuration. Int. J. Prod. Res. 25 (1), 101–113 (1987)

    Article  Google Scholar 

  2. Ballakur, A., Steudel, H.J.: A within cell utilization based heuristic for designing cellular manufacturing systems. Int. J. Prod. Res. 25, 639–655 (1987)

    Article  Google Scholar 

  3. Boctor, F.F.: A linear formulation of the machine-part cell formation problem. Int. J. Prod. Res. 29 (2), 343–356 (1991)

    Article  Google Scholar 

  4. Burbidge, J.L.: The new approach to production. Prod. Eng. 40, 3–19 (1961)

    Google Scholar 

  5. Bychkov, I., Batsyn, M., Pardalos, P.: Exact model for the cell formation problem. Optim. Lett. 8, 2203–2210 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  6. Chan, H.M., Milner, D.A.: Direct clustering algorithm for group formation in cellular manufacture. J. Manuf. Syst. 1 (1), 64–76 (1982)

    Article  Google Scholar 

  7. Chandrasekharan, M.P., Rajagopalan, R.: MODROC: an extension of rank order clustering for group technology. Int. J. Prod. Res. 24 (5), 1221–1233 (1986)

    Article  Google Scholar 

  8. Chandrasekharan, M.P., Rajagopalan, R.: An ideal seed non-hierarchical clustering algorithm for cellular manufacturing. Int. J. Prod. Res. 24 (2), 451–464 (1986)

    Article  MATH  Google Scholar 

  9. Chandrasekharan, M.P., Rajagopalan, R.: Groupability: analysis of the properties of binary data matrices for group technology. Int. J. Prod. Res. 27 (6), 1035–1052 (1989)

    Article  Google Scholar 

  10. Flanders, R.E.: Design manufacture and production control of a standard machine. Trans. ASME 46, 691–738 (1925)

    Google Scholar 

  11. Hsu, C.P.: Similarity coefficient approaches to machine-component cell formation in cellular manufacturing: a comparative study. Ph.D. Thesis, Department of Industrial and Manufacturing Engineering, University of Wisconsin Milwaukee (1990)

    Google Scholar 

  12. James, T.L., Brown, E.C., Keeling, K.B.: A hybrid grouping genetic algorithm for the cell formation problem. Comput. Oper. Res. 34 (7), 2059–2079 (2007)

    Article  MATH  Google Scholar 

  13. King, J.R.: Machine-component grouping in production flow analysis: an approach using a rank order clustering algorithm. Int. J. Prod. Res. 18 (2), 213–232 (1925)

    Article  Google Scholar 

  14. Kumar, K.R., Chandrasekharan, M.P.: Grouping efficacy: a quantitative criterion for goodness of block diagonal forms of binary matrices in group technology. Int. J. Prod. Res. 28 (2), 233–243 (1990)

    Article  Google Scholar 

  15. Kusiak, A.: The generalized group technology concept. Int. J. Prod. Res. 25 (4), 561–569 (1987)

    Article  Google Scholar 

  16. Kusiak, A., Chow, W.S.: Efficient solving of the group technology problem. J. Manuf. Syst. 6 (2), 117–124 (1987)

    Article  Google Scholar 

  17. Mitrofanov, S.P.: Nauchnye osnovy gruppovoy tekhnologii. Lenizdat, Leningrad, 435 p. (in Russian) (1959)

    Google Scholar 

  18. Mosier, C.T., Taube, L.: The facets of group technology and their impact on implementation. OMEGA 13 (6), 381–391 (1985)

    Article  Google Scholar 

  19. Seifoddini, H.: A note on the similarity coefficient method and the problem of improper machine assignment in group technology applications. Int. J. Prod. Res. 27 (7), 1161–1165 (1989)

    Article  Google Scholar 

  20. Seifoddini, H., Wolfe, P.M.: Application of the similarity coefficient method in group technology. IIE Trans. 18 (3), 271–277 (1986)

    Article  Google Scholar 

  21. Stanfel, L.: Machine clustering for economic production. Eng. Costs Prod. Econ. 9, 73–81 (1985)

    Article  Google Scholar 

  22. Waghodekar, P.H., Sahu, S.: Machine-component cell formation in group technology MACE. Int. J. Prod. Res. 22, 937–948 (1984)

    Article  Google Scholar 

Download references

Acknowledgements

This research is partly supported by LATNA Laboratory, NRU HSE, RF government grant 11.G34.31.0057.

Author information

Authors and Affiliations

  1. Laboratory of Algorithms and Technologies for Networks Analysis, National Research University Higher School of Economics, 136, Rodionova Str., Nizhny Novgorod, Russia

    Irina Utkina & Mikhail Batsyn

Authors
  1. Irina Utkina
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mikhail Batsyn
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Irina Utkina .

Editor information

Editors and Affiliations

  1. Laboratory of Algorithms and Technologies for Network Analysis (LATNA), National Research University Higher School of Economics, Nizhny Novgorod, Russia

    Valery A. Kalyagin

  2. Laboratory of Algorithms and Technologies for Network Analysis (LATNA), National Research University Higher School of Economics, Nizhny Novgorod, Russia

    Petr A. Koldanov

  3. Department of Industrial and System Engineering, Center for Applied Optimization University of Florida, Gainesville, Florida, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Utkina, I., Batsyn, M. (2016). A Branch and Bound Algorithm for the Cell Formation Problem. In: Kalyagin, V., Koldanov, P., Pardalos, P. (eds) Models, Algorithms and Technologies for Network Analysis. NET 2014. Springer Proceedings in Mathematics & Statistics, vol 156. Springer, Cham. https://doi.org/10.1007/978-3-319-29608-1_7

Download citation

Publish with us

Policies and ethics

Search

Navigation