Machine-part cell formation problems with constraint programming
Fecha
2016
Título de la revista
ISSN de la revista
Título del volumen
Editor
IEEE Computer Society
Resumen
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. © 2015 IEEE.
Descripción
Palabras clave
Computer Science, Engineering