Cell formation in group technology using constraint programming and Boolean satisfiability |
| |
| Authors: | Ricardo Soto Hakan Kjellerstrand Orlando Durán Broderick Crawford Eric Monfroy Fernando Paredes |
| |
| Affiliation: | 1. Pontificia Universidad Católica de Valparaíso, Chile;2. Independent Researcher, Sweden;3. Universidad Autónoma de Chile, Chile;4. Universidad Técnica Federico Santa María, Chile;5. Escuela de Ingeniería Industrial, Universidad Diego Portales, Santiago, Chile;1. Dept. of Industrial and Systems Engineering, Mississippi State University, Starkville, MS 39762, USA;2. Dept. of Industrial Engineering, University of Arkansas, Fayetteville, AR 72701, USA;1. Department of Chemical Engineering, Universidad de La Frontera, Francisco Salazar 01145, Temuco, Chile;2. INRIA-Chile, Avenida Apoquindo 2827, Piso 12, Las Condes, Santiago, Chile;3. Department of Chemistry & Center of Biotechnology & Center of Nanotechnology and Systems Biology, Universidad Técnica Federico Santa María, Avenida España 1680, Valparaíso, Chile;4. Escuela de Ingeniería Bioquímica, Pontificia Universidad Católica de Valparaíso (PUCV), Av. Brasil 2085, Valparaíso, Chile;5. Scientific and Technological Bioresource Nucleus (BIOREN), Universidad de La Frontera, Francisco Salazar 01145, Temuco, Chile;1. Escola Politécnica, Universidade de São Paulo, Brazil;2. Instituto de Matemática e Estatística, Universidade de São Paulo, Brazil;1. Stanford University 450 Serra Mall, Stanford, CA 94305, United States;2. Department of Mathematics, National University of Singapore, Singapore 117543, Singapore;1. UTFSM, Valparaíso, Chile;2. INRIA Rennes Bretagne-Atlantique, Rennes, France;1. Departament de Ciències de la Computació, Universitat Politècnica de Catalunya, 08032 Barcelona, Catalonia, Spain;2. LORIA (CNRS – Inria Nancy Grand-Est – Université de Lorraine), B.P. 239, 54506 Vand?uvre-lès-Nancy, France;3. Universidad Técnica Federico Santa María, Avenida España 1680, Valparaíso, Chile;4. Université de Lyon, CNRS, INSA-Lyon, LIRIS, UMR5205, F-69621, France;5. Infologic, 99 Avenue de Lyon, F-26500, Bourg-lès-Valence, France |
| |
| Abstract: | Cell formation consists in organizing a plant as a set of cells, each of them containing machines that process similar types or families of parts. The idea is to minimize the part flow among cells in order to reduce costs and increase productivity. The literature presents different approaches devoted to solve this problem, which are mainly based on mathematical programming and on evolutionary computing. Mathematical programming can guarantee a global optimal solution, however at a higher computational cost than an evolutionary algorithm, which can assure a good enough optimum in a fixed amount of time. In this paper, we model and solve this problem by using state-of-the-art constraint programming (CP) techniques and Boolean satisfiability (SAT) technology. We present different experimental results that demonstrate the efficiency of the proposed optimization models. Indeed, CP and SAT implementations are able to reach the global optima in all tested instances and in competitive runtime. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
