Scheduling a global engine maintenance network

This thesis addresses the allocation of gas turbine aircraft engines to maintenance facilities. Scheduling a global engine maintenance network can be very complex and challenging. This project pertains particularly to the V2500 IAE engine maintenance network managed by Pratt & Whitney. Using a mathematical program to automate engine allocation was believed to reduce the workload on the organization and the cost of maintaining the 3100 engine fleet. An introduction to the engine maintenance network will be covered along with an explanation of Fleet Hour Agreements (FHA). A literature review of mathematical programming is included to provide background of pertinent information. The current state of the business is analyzed. An integer linear program is developed to closely represent the current state of the business. Historical data was used to feed the model, and the outputs from the model were compared to actuals. A sensitivity analysis is performed to better understand the constraints of the current business and the feasibility of the model. An optimization model should not be used to plan engine maintenance given the current state of business. The business is too dynamic and the network is highly constrained by capacity. The results also show a much smaller savings than were originally expected. This is mostly due to better understanding the cost of maintaining the engines at the different shops. The variation was much lower than originally expected. The current state is operating close to optimal with great flexibility and should continue on as is.

Department dc:contributor.department

Leaders for Global Operations Program at MIT

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2016

Author dc:creator

• Gorang, Brandon Paul

Advisor dc:contributor.advisor

• Donald Rosenfield and Bruce G. Cameron.

• Sloan School of Management.
• Institute for Data, Systems, and Society.
• Engineering Systems Division.
• Leaders for Global Operations Program.

Statement dc:rights

• M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

eng

Handle dc:identifier.uri

http://hdl.handle.net/1721.1/104398

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/104398