A Team Allocation Decision for Aircraft Fleet Maintenance
Autor(a) principal: | |
---|---|
Data de Publicação: | 2021 |
Outros Autores: | , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
Texto Completo: | http://hdl.handle.net/10174/30672 https://doi.org/10.1088/1757-899X/1024/1/012102 |
Resumo: | This paper is about a computer application for planning maintenance of aircraft fleet in what regards allocation of skilled technicians. The formalization for this planning is a mathematical programming problem written as a minimizing one. The decision variables are the allocation of the skilled technicians. The data are the number of available technicians, the working hours needed to accomplish maintenance, the costs due to the daily operation of facilities, and due to the fleet downtime. Although, the formalization is of a non-linear integer-programming problem, a transformation of variables from positive integer ones to Boolean ones is conceivable and allows a reformulation as a pure integer linear programming problem. Also, a relaxation of the integer variables to continuous ones allows for a relaxed formulation as a convex non-linear programming problem. A case study of two fleets illustrates both formulations: solved by the pyomo library calling the GLPK for the pure linear integer programming problem and calling solvers in Scipy library for the relaxed formulation. An inference presented about the results of the case study addresses the issue of using nonlinear programming to emulate the solution of linear integer programming. |
id |
RCAP_1e950101d244bad0dc74c00b622d3fa8 |
---|---|
oai_identifier_str |
oai:dspace.uevora.pt:10174/30672 |
network_acronym_str |
RCAP |
network_name_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository_id_str |
7160 |
spelling |
A Team Allocation Decision for Aircraft Fleet MaintenanceAircraft maintenanceTeam AllocationDecisionrepair, and overhaulThis paper is about a computer application for planning maintenance of aircraft fleet in what regards allocation of skilled technicians. The formalization for this planning is a mathematical programming problem written as a minimizing one. The decision variables are the allocation of the skilled technicians. The data are the number of available technicians, the working hours needed to accomplish maintenance, the costs due to the daily operation of facilities, and due to the fleet downtime. Although, the formalization is of a non-linear integer-programming problem, a transformation of variables from positive integer ones to Boolean ones is conceivable and allows a reformulation as a pure integer linear programming problem. Also, a relaxation of the integer variables to continuous ones allows for a relaxed formulation as a convex non-linear programming problem. A case study of two fleets illustrates both formulations: solved by the pyomo library calling the GLPK for the pure linear integer programming problem and calling solvers in Scipy library for the relaxed formulation. An inference presented about the results of the case study addresses the issue of using nonlinear programming to emulate the solution of linear integer programming.2022-01-07T22:35:15Z2022-01-072021-02-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articlehttp://hdl.handle.net/10174/30672http://hdl.handle.net/10174/30672https://doi.org/10.1088/1757-899X/1024/1/012102engndruimelicio@gmail.comnd523Pereira, DuarteMelício, RuiMendes, Victorinfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2024-01-03T19:28:59Zoai:dspace.uevora.pt:10174/30672Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-20T01:20:06.140409Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse |
dc.title.none.fl_str_mv |
A Team Allocation Decision for Aircraft Fleet Maintenance |
title |
A Team Allocation Decision for Aircraft Fleet Maintenance |
spellingShingle |
A Team Allocation Decision for Aircraft Fleet Maintenance Pereira, Duarte Aircraft maintenance Team Allocation Decision repair, and overhaul |
title_short |
A Team Allocation Decision for Aircraft Fleet Maintenance |
title_full |
A Team Allocation Decision for Aircraft Fleet Maintenance |
title_fullStr |
A Team Allocation Decision for Aircraft Fleet Maintenance |
title_full_unstemmed |
A Team Allocation Decision for Aircraft Fleet Maintenance |
title_sort |
A Team Allocation Decision for Aircraft Fleet Maintenance |
author |
Pereira, Duarte |
author_facet |
Pereira, Duarte Melício, Rui Mendes, Victor |
author_role |
author |
author2 |
Melício, Rui Mendes, Victor |
author2_role |
author author |
dc.contributor.author.fl_str_mv |
Pereira, Duarte Melício, Rui Mendes, Victor |
dc.subject.por.fl_str_mv |
Aircraft maintenance Team Allocation Decision repair, and overhaul |
topic |
Aircraft maintenance Team Allocation Decision repair, and overhaul |
description |
This paper is about a computer application for planning maintenance of aircraft fleet in what regards allocation of skilled technicians. The formalization for this planning is a mathematical programming problem written as a minimizing one. The decision variables are the allocation of the skilled technicians. The data are the number of available technicians, the working hours needed to accomplish maintenance, the costs due to the daily operation of facilities, and due to the fleet downtime. Although, the formalization is of a non-linear integer-programming problem, a transformation of variables from positive integer ones to Boolean ones is conceivable and allows a reformulation as a pure integer linear programming problem. Also, a relaxation of the integer variables to continuous ones allows for a relaxed formulation as a convex non-linear programming problem. A case study of two fleets illustrates both formulations: solved by the pyomo library calling the GLPK for the pure linear integer programming problem and calling solvers in Scipy library for the relaxed formulation. An inference presented about the results of the case study addresses the issue of using nonlinear programming to emulate the solution of linear integer programming. |
publishDate |
2021 |
dc.date.none.fl_str_mv |
2021-02-01T00:00:00Z 2022-01-07T22:35:15Z 2022-01-07 |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/10174/30672 http://hdl.handle.net/10174/30672 https://doi.org/10.1088/1757-899X/1024/1/012102 |
url |
http://hdl.handle.net/10174/30672 https://doi.org/10.1088/1757-899X/1024/1/012102 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
nd ruimelicio@gmail.com nd 523 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.source.none.fl_str_mv |
reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação instacron:RCAAP |
instname_str |
Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
collection |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository.name.fl_str_mv |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
repository.mail.fl_str_mv |
|
_version_ |
1799136682323214336 |