Method and Means for Optimizing Maintenance Work Schedules

• US 20080162235A1
• Filed: 12/30/2006
• Published: 07/03/2008
• Est. Priority Date: 12/30/2006
• Status: Abandoned Application

• Current Assignee: United Technologies Corporation (Raytheon Technologies Corporation d/b/a RTX)
• Original Assignee: United Technologies Corporation (Raytheon Technologies Corporation d/b/a RTX)
• Inventors: Winston, Howard A., Matonak, Beth K., Ireland, Julie A., Tomastik, Robert N., Wang, Jihua, Sirag, David J.
• Application Number:
  US11/618,802
• Publication Number:
  US 20080162235A1
• Time in Patent Office: Days
• US Class Current: 705/8
• CPC Class Codes: G06Q 10/06 Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
• CPC Class Codes: G06Q 10/06314 Calendaring for a resource
• CPC Class Codes: G06Q 10/0637 Strategic management or analysis, e.g. setting a goal or target of an organisation; Planning actions based on goals; Analysis or evaluation of effectiveness of goals
• CPC Class Codes: G06Q 10/06375 Prediction of business process outcome or impact based on a proposed change

Abstract

The optimization algorithm described herein combines stochastic programming and intelligent enumeration schemes that exploit the problem structure to avoid evaluating solutions that on their face are known to be non-optimal. The optimization algorithm finds the module workscope decisions and LLP replacement decisions that minimize expected future maintenance cost per engine flight cycle. The optimization algorithm considers the enormous number of possible solutions, and determines the best one.

Claims

1. A process for optimizing maintenance work schedules in a fleet management program for at least one engine, comprising:

creating at least one possible LLP workscope decision for a first shop visit for at least one engine;

creating at least one unscheduled engine repair scenario for each of said at least one possible LLP workscope decision for said first shop visit;

selecting one of said at least one unscheduled engine repair scenario for one of said at least one possible LLP workscope decision for said first shop visit;

calculating at least one expected cost for said one of said unscheduled engine repair scenario for said first shop visit;

determining a lowest expected cost of said at least one expected cost for said one of said unscheduled engine repair scenario for said first shop visit;

associating said lowest expected cost with at least one of said at least one possible LLP workscope decisions for said first shop visit;

selecting an LLP workscope decision out of said at least one possible LLP workscope decision based upon the association with said lowest expected cost for said first shop visit; and

performing upon said at least one engine said LLP workscope decision having said lowest expected cost.

2. The process of claim 1, wherein prior to the selection step of said one of said at least one unscheduled engine repair scenario further, the process further comprises:

evaluating said at least one unscheduled repair scenario according to an equation

3. The process of claim 1, further comprising the steps of:

selecting a next unscheduled engine repair scenario for said one of said at least one possible LLP workscope decision;

calculating a next expected cost of said at least one expected cost for said next unscheduled engine repair scenario;

determining said lowest expected cost;

selecting said workscope decision having said lowest expected cost for said first shop visit; and

performing said workscope decision having said lowest expected cost upon said engine.

4. The process of claim 1, wherein the calculation step of said at least one expected cost comprises the following steps:

calculating at least one optimal cost per engine flight cycle for all of said at least one unscheduled engine repair scenario with respect to each of said at least one workscope decision; and

generating said at least one expected cost based upon said at least one optimal cost per engine flight cycle.

5. The process of claim 1, wherein the determination step of said lowest expected cost comprises the steps of:

comparing all of said at least one expected cost with each other; and

selecting said lowest expected cost of all of said at least one expected cost.

6. The process of claim 1, further comprising the following steps:

enumerating at least one possible solution comprising at least one optimal LLP workscope decision or at least one non- optimal LLP workscope decision;

applying at least one of four insights to identify said at least one non-optimal LLP workscope decision;

identifying said at least one non-optimal LLP workscope decision as a non-optimal solution; and

identifying said at least one optimal LLP workscope decision as an optimal solution;

wherein said at least one optimal LLP workscope decision is said workscope decision having said lowest expected cost.

7. A process for optimizing maintenance work schedules in a fleet management program for at least one engine, comprising:

creating at least one possible LLP workscope decision for a first shop visit for at least one engine;

creating at least one unscheduled engine repair scenario for each of said at least one possible LLP workscope decision for said at least one engine;

evaluating said at least one unscheduled repair scenario according to an equation

8. A system comprising a computer readable storage device readable by the system, tangibly embodying a program having a set of instructions executable by the system to perform the following steps for optimizing maintenance work schedules of a fleet management program for at least one engine, the set of instructions comprising:

an instruction to create at least one possible LLP workscope decision for a first shop visit for at least one engine;

an instruction to create at least one unscheduled engine repair scenario for each of said at least one possible LLP workscope decision for said first shop visit;

an instruction to select one of said at least one unscheduled engine repair scenario for one of said at least one possible workscope decision for said first shop visit;

an instruction to calculate at least one expected cost for said one of said unscheduled engine repair scenario for said first shop visit;

an instruction to determine a lowest expected cost of said at least one expected cost for said one of said unscheduled engine repair scenario for said first shop visit;

an instruction to associate said lowest expected cost with at least one of said at least one possible LLP workscope decision for said first shop visit;

an instruction to select an LLP workscope decision out of said at least one possible LLP workscope decision based upon the association with said lowest expected cost for said first shop visit; and

an instruction to perform said LLP workscope decision having said lowest expected cost upon said at least one engine.

9. The system of claim 8, wherein prior to the instruction to select said one of said at least one unscheduled engine repair scenario, the set of instructions further comprises:

an instruction to evaluate said at least one unscheduled repair scenario according to an equation

10. The system of claim 8, further comprising the following instructions:

an instruction to select a next unscheduled engine repair scenario for said one of said at least one possible LLP workscope decision;

an instruction to calculate a next expected cost of said at least one expected cost for said next unscheduled engine repair scenario;

an instruction to determine said lowest expected cost;

an instruction to select said workscope decision having said lowest expected cost for said first shop visit; and

an instruction to perform said workscope decision having said lowest expected cost upon said engine.

11. The system of claim 8, wherein the instruction to calculate said at least one expected cost comprises the following instructions:

calculating at least one optimal cost per engine flight cycle for all of said at least one unscheduled engine repair scenario with respect to each of said at least one workscope decision; and

generating said at least one expected cost based upon said at least one optimal cost per engine flight cycle.

12. The system of claim 8, wherein the instruction to determine said lowest expected cost comprises the following instructions:

an instruction to compare all of said at least one expected cost with each other; and

an instruction to select said lowest expected cost of all of said at least one expected cost.

13. The system of claim 8, further comprising the following instructions:

an instruction to enumerate at least one possible solution comprising at least one optimal LLP workscope decision or at least one non-optimal LLP workscope decision;

an instruction to apply at least one of four insights to identify said at least one non-optimal LLP workscope decision;

an instruction to identify said at least one non-optimal LLP workscope decision as a non-optimal solution; and

an instruction to identify said at least one optimal LLP workscope decision as an optimal solution;

wherein said at least one optimal LLP workscope decision is said workscope decision having said lowest expected cost.

14. A system comprising a computer readable storage device readable by the system, tangibly embodying a program having a set of instructions executable by the system to perform the following steps for optimizing maintenance work schedules of a fleet management program for at least one engine, the set of instructions comprising:

an instruction to create at least one possible LLP workscope decision for a first shop visit for at least one engine;

an instruction to create at least one unscheduled engine repair scenario for each of said at least one possible LLP workscope decision for at least one engine;

an instruction to evaluate said at least one unscheduled repair scenario according to an equation