An off-line dual maximum resource bin packing model for solving the maintenance problem in the aviation industry

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21220%2F13%3A00209293" target="_blank" >RIV/68407700:21220/13:00209293 - isvavai.cz</a>

Výsledek na webu

<a href="http://cks.univnt.ro/cks_2013_archive/cks_2013_articole.html" target="_blank" >http://cks.univnt.ro/cks_2013_archive/cks_2013_articole.html</a>

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

An off-line dual maximum resource bin packing model for solving the maintenance problem in the aviation industry

Popis výsledku v původním jazyce

In the aviation industry, propeller motor engines have a lifecycle of several thousand hours of flight and the maintenance is an important part of their lifecycle. The present article considers a multi-resource, priority-based case scheduling problem, which is applied in a Romanian manufacturing company, that repairs and maintains helicopter and airplane engines at a certain quality level imposed by the aviation standards. Given a reduced budget constraint, the management?s goal is to maximize the utilization of their resources (financial, material, space, workers), by maintaining a prior known priority rule. An Off-Line Dual Maximum Resource Bin Packing model, based on a Mixed Integer Programing model is thus presented. The obtained results show an increase with approx. 25% of the Just in Time shipping of the engines to the customers and approx. 12,5% increase in the utilization of the working area.

Název v anglickém jazyce

An off-line dual maximum resource bin packing model for solving the maintenance problem in the aviation industry

Popis výsledku anglicky

In the aviation industry, propeller motor engines have a lifecycle of several thousand hours of flight and the maintenance is an important part of their lifecycle. The present article considers a multi-resource, priority-based case scheduling problem, which is applied in a Romanian manufacturing company, that repairs and maintains helicopter and airplane engines at a certain quality level imposed by the aviation standards. Given a reduced budget constraint, the management?s goal is to maximize the utilization of their resources (financial, material, space, workers), by maintaining a prior known priority rule. An Off-Line Dual Maximum Resource Bin Packing model, based on a Mixed Integer Programing model is thus presented. The obtained results show an increase with approx. 25% of the Just in Time shipping of the engines to the customers and approx. 12,5% increase in the utilization of the working area.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

AH - Ekonomie

OECD FORD obor

—

Projekt

<a href="/cs/project/GAP403%2F12%2F1950" target="_blank" >GAP403/12/1950: Navrhování experimentů v oblasti vývoje produktu a více-faktorová optimalizace produkce</a><br>

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2013

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Challenges of the Knowledge Society

ISSN

2068-7796

e-ISSN

—

Svazek periodika

7

Číslo periodika v rámci svazku

5

Stát vydavatele periodika

RO - Rumunsko

Počet stran výsledku

10

Strana od-do

—

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—