Please use this identifier to cite or link to this item:
http://hdl.handle.net/10174/31021
|
Title: | Planning of aircraft fleet maintenance teams |
Authors: | Pereira, Duarte Gomes, Isaias Melício, Rui Mendes, Victor |
Keywords: | Aircraft fleet Linear integer programming Problem of planning Efficiency Maintenance teams Scheduling Optimization |
Issue Date: | May-2021 |
Abstract: | This paper addresses a support information system for the planning of aircraft maintenance teams, assisting maintenance managers in delivering aircraft on time. The developed planning of aircraft maintenance teams is a computer application based on a mathematical programming problem written as a minimization one. The initial decision variables are positive integer variables specifying the allocation of available technicians by skills to maintenance teams. The objective function is a nonlinear function balancing the time spent and costs incurred with aircraft fleet maintenance. The data involves the technicians’ skills, the hours of work to perform maintenance tasks, the costs related to facilities, and the aircraft downtime cost. The realism of this planning entails random possibilities associated with maintenance workload data, and inference by a procedure of Monte Carlo simulation provides a proper set of workloads instead of going through all the possibilities. The based formalization is a nonlinear integer programming problem, converted into an equivalent pure linear integer programming problem, using a transformation from initial positive integer variables to Boolean ones. A case study addresses the use of this support information system for planning a team for aircraft maintenance of three lines under the uncertainty of workloads, and a discussion of results shows the serviceableness of the proposed support information system. |
URI: | http://hdl.handle.net/10174/31021 |
Type: | article |
Appears in Collections: | DEM - Publicações - Artigos em Revistas Internacionais Com Arbitragem Científica
|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
|