Services on Demand
Journal
Article
Indicators
- Cited by SciELO
- Access statistics
Related links
- Cited by Google
- Similars in SciELO
- Similars in Google
Share
DYNA
Print version ISSN 0012-7353
Abstract
DIAZ-CAZANA, Ronald; COSTA-SALAS, Yasel José and SARACHE-CASTRO, William Ariel. Heuristic for production scheduling on job-shop plants considering preventive maintenance tasks. Dyna rev.fac.nac.minas [online]. 2014, vol.81, n.187, pp.215-222. ISSN 0012-7353. https://doi.org/10.15446/dyna.v81n186.46103.
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.
Keywords : simultaneous programming; production scheduling; preventive maintenance; linear programming model.