Solving Manufacturing Cell Design Problems Using Constraint Programming
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.
Unable to display preview. Download preview PDF.
- 1.Manufacturing Cell Design Models, http://www.inf.ucv.cl/~rsoto/MCDP (visited 11/2011)
- 5.Bessière, C.: Constraint Propagation. In: Handbook of Constraint Programming, pp. 29–84. Elsevier (2006)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
- 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
- 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
- 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