Skip to main content

Solving Manufacturing Cell Design Problems Using Constraint Programming

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7345))

Abstract

A manufacturing cell design problem (MCDP) consists in creating an optimal production plant layout. The production plant is composed of cells which in turn are composed of machines that process part families of products. The goal is to minimize part flow among cells in order to reduce production costs and increase productivity. In this paper, we focus on modeling and solving the MCDP by using state-of-the-art constraint programming (CP) techniques. We implement different optimization models and we solve it by using two solving engines. Our preliminary results demonstrate the efficiency of the proposed implementations, indeed the global optima is reached in all instances and in competitive runtime.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Manufacturing Cell Design Models, http://www.inf.ucv.cl/~rsoto/MCDP (visited 11/2011)

  2. Aljaber, N., Baek, W., Chen, C.: A tabu search approach to the cell formation problem. Computers and Industrial Engineering 32(1), 169–185 (1997)

    Article  Google Scholar 

  3. Boctor, F.: A linear formulation of the machine-part cell formation problem. International Journal Production Research 29(2), 343–356 (1991)

    Article  Google Scholar 

  4. Boulif, M., Atif, K.: A new branch-&-bound-enhanced genetic algorithm for the manufacturing cell formation problem. Computers and Operations Research 33, 2219–2245 (2006)

    Article  MATH  Google Scholar 

  5. Bessière, C.: Constraint Propagation. In: Handbook of Constraint Programming, pp. 29–84. Elsevier (2006)

    Google Scholar 

  6. Durán, O., Rodriguez, N., Consalter, L.A.: Collaborative particle swarm optimization with a data mining technique for manufacturing cell design. Expert Syst. Appl. 37(2), 1563–1567 (2010)

    Article  Google Scholar 

  7. Gent, I.P., Smith, B.M.: Symmetry breaking in constraint programming. In: Proceedings of the 14th ECAI, pp. 599–603. IOS Press (2000)

    Google Scholar 

  8. James, T., Brown, E., Keeling, K.: A hybrid grouping genetic algorithm for the cell formation problem. Computers and Operations Research 34(7), 2059–2079 (2007)

    Article  MATH  Google Scholar 

  9. Kusiak, A., Chow, W.S.: Efficient solving of the group technology problem. Journal of Manufacturing Systems 6, 117–124 (1987)

    Article  Google Scholar 

  10. Lozano, S., Díaz, A., Eguía, I., Onieva, L.: A one-step tabu search algorithm for manufacturing cell design. Journal of the Operational Research Society 50(5) (1999)

    Google Scholar 

  11. Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.: MiniZinc: Towards a Standard CP Modelling Language. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 529–543. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  12. Olivia-Lopez, E., Purcheck, G.F.K.: Load balancing for group technology planning and control. International Journal of MTDR 19, 259–268 (1979)

    Google Scholar 

  13. Puget, J.F.: A C++ implementation of CLP. In: SCIS, Singapore (1994)

    Google Scholar 

  14. Purcheck, G.F.K.: A linear - programming method for the combinatorial grouping of an incomplete set. Journal of cybernetics 5, 51–58 (1975)

    Article  MathSciNet  Google Scholar 

  15. Régin, J.-C.: A Filtering Algorithm for Constraints of Difference in CSPs. In: Proceedings of the 12th AAAI, pp. 362–367 (1994)

    Google Scholar 

  16. Schulte, C., Tack, G.: Views and Iterators for Generic Constraint Implementations. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 817–821. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  17. Selim, H., Askin, R., Vakharia, A.: Cell formation in group technology: review, evaluation and directions for future research. Computers and Industrial Engineering 34(1), 3–20 (1998)

    Article  Google Scholar 

  18. Venugopal, V., Narendran, T.T.: A genetic algorithm approach to the machine-component grouping problem with multiple objectives. Computers and Industrial Engineering 22(4), 469–480 (1992)

    Article  Google Scholar 

  19. Wu, T., Chang, C., Chung, S.: A simulated annealing algorithm for manufacturing cell formation problems. Expert Syst. Appl. 34(3), 1609–1617 (2008)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Soto, R., Kjellerstrand, H., Gutiérrez, J., López, A., Crawford, B., Monfroy, E. (2012). Solving Manufacturing Cell Design Problems Using Constraint Programming. In: Jiang, H., Ding, W., Ali, M., Wu, X. (eds) Advanced Research in Applied Artificial Intelligence. IEA/AIE 2012. Lecture Notes in Computer Science(), vol 7345. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31087-4_42

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31087-4_42

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31086-7

  • Online ISBN: 978-3-642-31087-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics