Machine-part cell formation problems with constraint programming

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...

Full description

Saved in:

Bibliographic Details
Published in:	2015 34th International Conference of the Chilean Computer Science Society (SCCC) pp. 1 - 4
Main Authors:	Sotoyz, Ricardo, Crawford, Broderick, Almonacid, Boris, Paredes, Fernando, Loyola, Ernesto
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01-11-2015
Subjects:	Constraint Programming Context Java Linear programming Machine-Part Cell Formation Mathematical model Optimization Programming Search problems
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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