Integrative Programming of Production and Preventive Maintenance Tasks in an Environment of Identical Parallel Machines: Proposal of a Construction Heuristic

Delgado Sobrino Daynier Rolando (), Díaz Cazañas Ronald (), Ružarovský Roman () and Holubek Radovan ()
Additional contact information
Delgado Sobrino Daynier Rolando: Slovak University of Technology in Bratislava, Faculty of Materials Science and Technology in Trnava, Institute of Production Technologies, Ulica Jána Bottu 2781/25, 917 24Trnava, Slovak Republic
Díaz Cazañas Ronald: Central University “Marta Abreu” De Las Villas, Faculty of Mechanical and Industrial Engineering, 5½ Km. Camajuaní Road, 54 830, Santa Clara, Villa Clara, Cuba
Ružarovský Roman: Slovak University of Technology in Bratislava, Faculty of Materials Science and Technology in Trnava, Institute of Production Technologies, Ulica Jána Bottu 2781/25, 917 24Trnava, Slovak Republic
Holubek Radovan: Slovak University of Technology in Bratislava, Faculty of Materials Science and Technology in Trnava, Institute of Production Technologies, Ulica Jána Bottu 2781/25, 917 24Trnava, Slovak Republic

Research Papers Faculty of Materials Science and Technology Slovak University of Technology, 2018, vol. 26, issue 42, 127-134

Abstract: The article presents a constructive heuristic for the integrated programming of production orders and preventive maintenance (PM) interventions in an environment of identical parallel machines, aimed at minimizing the completion time of the last scheduled job (makespan). Unlike other proposals found in the literature, the one here considers that the time between preventive interventions is not previously known, but instead, this is assumed as one of the decision variables of the system in the beginning of each of these interventions; in addition, the proposal also considers the possibility that not all jobs have the same release time. The design of the heuristic algorithm is based on the general approach of the Longest Processing Time dispatch rule, with a slight modification in its conception to consider the random character of the equipment failures and their impact on the execution time of the tasks. Consequently, a simple dispatch rule called rj - LPT was also proposed to comply with one of the steps of the heuristic, as well as an algorithm to determine the minimum dimension for the makespan, which constitutes the basis of the stop criterion linked to the initial solution.

Keywords: Production programming; maintenance programming; construction heuristic; algorithm; Longest Processing Time rule (LPT); pseudo-code (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.2478/rput-2018-0015 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:vrs:repfms:v:26:y:2018:i:42:p:127-134:n:15

DOI: 10.2478/rput-2018-0015

Access Statistics for this article

Research Papers Faculty of Materials Science and Technology Slovak University of Technology is currently edited by Kvetoslava Rešetová

More articles in Research Papers Faculty of Materials Science and Technology Slovak University of Technology from Sciendo
Bibliographic data for series maintained by Peter Golla ().