Heuristic for production scheduling on job-shop plants considering preventive maintenance tasks

The simultaneous analysis of production scheduling and preventive maintenance task attracts special attention of researchers due to its complexity and therefore the necessity to seek efficient methods for solving this kind of combinatorial problems. This paper presents a heuristic approach to solve this issue on job shop plants. The solution method includes a linear programming model, based on the Traveling Salesman Problem, where the setup time is considered as distance measure. The method´s aim is to obtain a sequence of production orders and preventive maintenance tasks that reduce the idle time and the backlogs simultaneously, accomplishing the maintenance program. After finding an optimal solution for each machine a Correction Factor (CF) is determined as new distance measure. The CF considers the structure of the initial solution, the machine utilization and the product priorities. Then, the final solution is reached running the linear programming model using the distance updated values. Finally, the proposed heuristic is applied to real case study of the Cuban industry. The experimental results indicated a significant idle time reduction for the company under examination.

• Autores: Díaz Cazaña, Ronald; Costa Salas, Yasel José; Sarache Castro, William Ariel
• Tipo de recurso: Article of journal
• Fecha de publicación: 2014
• Institución: Universidad Nacional de Colombia
• Repositorio: Universidad Nacional de Colombia
• Idioma: spa
• OAI Identifier: oai:repositorio.unal.edu.co:unal/50623
• Acceso en línea: https://repositorio.unal.edu.co/handle/unal/50623; http://bdigital.unal.edu.co/44621/
• Palabra clave: simultaneous programming; production scheduling; preventive maintenance; linear programming model.
• Rights: openAccess
• License: Atribución-NoComercial 4.0 Internacional