A linear programming model for the parallel non-related machines problem, in the drying area of a chilean sawmill

Scheduling of activities in manufacturing and service enterprises should perform efficiently, since it impacts both productivity and competitiveness. This study analyzes a real case of green wood dryers in a sawmill in Chile, with a set of ten parallel machines with three different technologies, with 161 jobs, on a monthly planning horizon. The methodology considered two stages: first, the products were grouped by density and fiber type; second, a mathematical model was proposed based on linear programming, which was modeled with AMPL software. In addition, we conducted a statistical analysis to evaluate the solution quality and the computing times, using the CPLEX and GUROBI commercial solvers. The results of the computational experiment showed a reduction in the makespan of 8.5 %, allowing us to conclude that the solver CPLEX is better than the solver GUROBI, regarding CPU time and number of instances optimally solved in 59.3 % of the analyzed cases. The most influential parameters for computing time were GUROBI cuts (evaluated at 0), CPLEX mipcuts (evaluated at 2), and repeatpresolve (evaluated at 0). The time difference in the latter parameter was statistically significant.

• Fecha de publicación: 2017
• Institución: Universidad Pedagógica y Tecnológica de Colombia
• Repositorio: RiUPTC: Repositorio Institucional UPTC
• Idioma: eng
• OAI Identifier: oai:repositorio.uptc.edu.co:001/14188
• Acceso en línea: https://revistas.uptc.edu.co/index.php/ingenieria/article/view/7309; https://repositorio.uptc.edu.co/handle/001/14188
• Palabra clave: Parallel machines; Parameterization; Scheduling of the production; Máquinas paralelas; Parametrización; Programación de la producción
• License: http://purl.org/coar/access_right/c_abf59