AN OFF-LINE DUAL MAXIMUM RESOURCE BIN PACKING MODEL FOR SOLVING THE MAINTENANCE PROBLEM IN THE AVIATION INDUSTRY

Challenges of the Knowledge Society

MICHAL KAVAN¹  GEORGE CRISTIAN GRUIA² 

[1] Associate Professor, Ph.D., Czech Technical University in Prague, ([e-mail]).;Graduate Teaching Assistant, Ph.D. Candidate, Czech Technical University in Prague, ([e-mail]).;

关键词: bin packing;    maximization;    resources;    scheduling;   

DOI  :  

来源: DOAJ

【 摘 要 】

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.

【 授权许可】

Unknown