Solving Manufacturing Cell Design Problems Using Constraint Programming

  • Ricardo Soto
  • Hakan Kjellerstrand
  • Juan Gutiérrez
  • Alexis López
  • Broderick Crawford
  • Eric Monfroy
Conference paper

DOI: 10.1007/978-3-642-31087-4_42

Volume 7345 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Ricardo Soto
    • 1
  • Hakan Kjellerstrand
    • 2
  • Juan Gutiérrez
    • 1
  • Alexis López
    • 1
  • Broderick Crawford
    • 1
  • Eric Monfroy
    • 3
  1. 1.Pontificia Universidad Católica de ValparaísoChile
  2. 2.Sweden
  3. 3.CNRS, LINAUniversité de NantesFrance