| dc.contributor.author | Al-Refaie, Abbas | |
| dc.contributor.author | Al-Shalaldeh, Heba | |
| dc.contributor.author | Lepkova, Natalija | |
| dc.date.accessioned | 2023-09-18T20:24:32Z | |
| dc.date.available | 2023-09-18T20:24:32Z | |
| dc.date.issued | 2020 | |
| dc.identifier.issn | 1392-3730 | |
| dc.identifier.uri | https://etalpykla.vilniustech.lt/handle/123456789/149732 | |
| dc.description.abstract | Production lines are usually subjected to emergent machine failures. Such emergent failures disrupt pre-established maintenance schedules, which challenge maintenance engineers to react to those failures in real time. This research proposes an optimization procedure for optimizing scheduling repairs of emergent failures. Three optimization models are developed. Model I schedules failures in newly idle repair shops with the objective of maximizing the number of scheduled repairs. Model II maximizes the number of assigned repairs to untapped ranges. Model III maximizes both the number of assigned failure repairs and satisfaction on regular and emergency repairs by resequencing regular and emergent failures in the shop that contains the largest free margin. A real case study is provided to illustrate the proposed optimization procedure. Results reveal that the proposed models efficiently scheduled and sequenced emergent failures in the idle maintenance shops, the untapped ranges between repairs of regular failures, and in the maintenance shop with the largest free margin. In conclusions, the proposed models can greatly support maintenance engineers in planning repairs under unexpected failures. | eng |
| dc.format | PDF | |
| dc.format.extent | p. 396-409 | |
| dc.format.medium | tekstas / txt | |
| dc.language.iso | eng | |
| dc.relation.isreferencedby | Scopus | |
| dc.relation.isreferencedby | DOAJ | |
| dc.relation.isreferencedby | Gale's Academic OneFile | |
| dc.relation.isreferencedby | Business Source Complete | |
| dc.relation.isreferencedby | TOC Premier | |
| dc.relation.isreferencedby | Science Citation Index Expanded (Web of Science) | |
| dc.source.uri | https://journals.vgtu.lt/index.php/JCEM/article/view/12315/9878 | |
| dc.source.uri | https://doi.org/10.3846/jcem.2020.12315 | |
| dc.title | Proposed procedure for optimal maintenance scheduling under emergent failures | |
| dc.type | Straipsnis Web of Science DB / Article in Web of Science DB | |
| dcterms.accessRights | Copyright © 2020 The Author(s). Published by VGTU PressThis is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/), which permits unre-stricted use, distribution, and reproduction in any medium, provided the original author and source are credited. | |
| dcterms.license | Creative Commons – Attribution – 4.0 International | |
| dcterms.references | 39 | |
| dc.type.pubtype | S1 - Straipsnis Web of Science DB / Web of Science DB article | |
| dc.contributor.institution | University of Jordan, Amman | |
| dc.contributor.institution | Vilniaus Gedimino technikos universitetas | |
| dc.contributor.faculty | Statybos fakultetas / Faculty of Civil Engineering | |
| dc.subject.researchfield | T 002 - Statybos inžinerija / Construction and engineering | |
| dc.subject.vgtuprioritizedfields | SD0404 - Statinių skaitmeninis modeliavimas ir tvarus gyvavimo ciklas / BIM and Sustainable lifecycle of the structures | |
| dc.subject.ltspecializations | L104 - Nauji gamybos procesai, medžiagos ir technologijos / New production processes, materials and technologies | |
| dc.subject.en | emergency events | |
| dc.subject.en | maintenance scheduling | |
| dc.subject.en | satisfaction model | |
| dc.subject.en | fuzzy goal programming | |
| dcterms.sourcetitle | Journal of civil engineering and management | |
| dc.description.issue | iss. 4 | |
| dc.description.volume | vol. 26 | |
| dc.publisher.name | VGTU Press | |
| dc.publisher.city | Vilnius | |
| dc.identifier.doi | 000530873900006 | |
| dc.identifier.doi | 10.3846/jcem.2020.12315 | |
| dc.identifier.elaba | 56588568 | |