scholarly journals Planning of Aircraft Fleet Maintenance Teams

Aerospace ◽  
2021 ◽  
Vol 8 (5) ◽  
pp. 140
Author(s):  
Duarte P. Pereira ◽  
Isaias L. R. Gomes ◽  
Rui Melicio ◽  
Victor M. F. Mendes

This paper addresses a support information system for the planning of aircraft maintenance teams, assisting maintenance managers in delivering an 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 involve technicians’ skills, hours of work to perform maintenance tasks, costs related to facilities, and the aircraft downtime cost. The realism of this planning entails random possibilities associated with maintenance workload data, and the 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 to plan 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.

1988 ◽  
Vol 11 (4) ◽  
pp. 811-814
Author(s):  
Balasubramanian Ram ◽  
A. J. G. Babu

This paper suggests a method of formulating any nonlinear integer programming problem, with any number of constraints, as an equivalent single constraint problem, thus reducing the dimensionality of the associated dynamic programming problem.


2006 ◽  
Vol 05 (03) ◽  
pp. 531-543 ◽  
Author(s):  
FENGMEI YANG ◽  
GUOWEI HUA ◽  
HIROSHI INOUE ◽  
JIANMING SHI

This paper deals with two bi-objective models arising from competitive location problems. The first model simultaneously intends to maximize market share and to minimize cost. The second one aims to maximize both profit and the profit margin. We study some of the related properties of the models, examine relations between the models and a single objective parametric integer programming problem, and then show how both bi-objective location problems can be solved through the use of a single objective parametric integer program. Based on this, we propose two methods of obtaining a set of efficient solutions to the problems of fundamental approach. Finally, a numerical example is presented to illustrate the solution techniques.


Sign in / Sign up

Export Citation Format

Share Document