Machine-part cell formation problems with constraint programming

Abstract

Machine-Part Cell Formation consists on organizing a plant as a set of cells, each one of them processing machines containing different part types. In recent years, different techniques have been used to solve this problem ranging from exact to approximate methods. This paper focuses on solving new instances of this problem for which no optimal value exists by using the classic Boctor's mathematical model. We employ constraint programming as the underlying solving technique illustrating that global optimums are achieved for the whole set of tested instances.

DOI: 10.1109/SCCC.2015.7416567

6 Figures and Tables

Cite this paper

@article{Soto2015MachinepartCF, title={Machine-part cell formation problems with constraint programming}, author={Ricardo Soto and Broderick Crawford and Boris Almonacid and Fernando Paredes and Ernesto Loyola}, journal={2015 34th International Conference of the Chilean Computer Science Society (SCCC)}, year={2015}, pages={1-4} }