A Constraint Programming Model for the Scheduling of Flexible Manufacturing Systems with Resource Limitations

LUIS J. ZEBALLOS; OSCAR D. QUIROGA; GABRIELA P. HENNING

ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE

ELSEVIER

Lugar: Trabajo en segunda etapa de revisión (revisiones menores); Año: 2008 p. 1 - 58

0952-1976

EN SEGUNDA ETAPA DE REVISIÓN (REVISIONES MENORES) This contribution presents an integrated Constraint Programming (CP) model to tackle the problems of tool allocation, machine loading, part routing and scheduling in a Flexible Manufacturing System (FMS). The formulation, which is able to take into account a variety of constraints found in industrial environments as well as several objective functions, has been successfully applied to the solution of various case studies of different sizes. Though some of the problem instances have bigger sizes than the examples reported up to now in literature, very good quality solutions were reached in quite reasonable CPU times. This good computational performance is due to two essential characteristics of the proposed model. The most significant one is the use of two sets of two-index variables to capture manufacturing activities instead of just one having four indexes. Thus, dimensionality is greatly reduced. The other relevant feature is the fact that the model relies on an indirect representation of tool needs by means of tool types; hence avoiding the consideration of tool instances.