Systems and methods for creating a near optimal maintenance plan

• US 8,782,467 B2
• Filed: 02/01/2012
• Issued: 07/15/2014
• Est. Priority Date: 02/01/2012
• Status: Active Grant

• Current Assignee: Automation Intelligence Incorporated, Honeywell International Inc.
• Original Assignee: Honeywell International Inc.
• Inventors: Kolbet, David Michael, Patankar, Ravindra, Magnuson, Randy R.
• Primary Examiner(s): GUYTON, PHILIP A
• Application Number:
  US13/363,737
• Publication Number:
  US 20130198556A1
• Time in Patent Office: 895 Days
• Field of Search: 714/26
• US Class Current: 714/26
• CPC Class Codes: G06Q 10/20 Administration of product repair or maintenance

Abstract

Methods and apparatus are provided for determining a lowest total cost maintenance plan. The method comprises receiving a sequence of maintenance actions in an order of a waiting time for each maintenance action, wherein one of the maintenance actions is likely to repair the failure mode. Each maintenance action has an associated cost equal to a waiting time cost, an execution time cost and a material cost, wherein the waiting time of each maintenance action is the time required to requisition and receive material required to perform the maintenance action. The method also constructs a maintenance plan comprising a primary requisition and a secondary requisition by assigning each of the sequence of maintenance actions to one of the primary and secondary requisition.

Claims

1. A method for determining a minimum cost maintenance plan for correcting a casualty in a complex machine, comprising:

receiving ambiguity group information by a processor comprising a plurality of failure modes of an ambiguity group associated with the casualty, their related probabilities of resolution and related corrective actions for each failure mode of the plurality, wherein a corrective action is one of a repair procedure and an isolation procedure;

determining the lowest cost corrective action within the ambiguity group,

when the lowest cost corrective action is a repair procedure, then sequencing the repair procedure into a maintenance plan sequence of corrective actions;

when the lowest cost corrective action is an isolation procedure, then;

determining if any combination and permutation of all unsequenced repair procedures associated with the ambiguity group have a lower cost than a combined cost of the isolation procedure and its associated repair procedure,

when one of a combination and permutation of all unsequenced repair procedures has the lower cost, then sequencing a first repair procedure in the sequence of the one of a combination and permutation into the maintenance plan sequence of corrective actions,

when no combination and permutation of all unsequenced repair procedures has the lower cost, then sequencing the isolation procedure in the maintenance plan sequence of the one of a combination and permutation into the maintenance plan sequence of corrective actions; and

repeating the determining the lowest cost corrective action step until all failure mode corrective actions have been sequenced into the maintenance plan sequence.

2. The method of claim 1, wherein the failure mode related probabilities are normalized probabilities.

3. The method of claim 2, wherein the lowest cost corrective action is determined after adjusting a cost of the corrective action by dividing the cost of the corrective action by the normalized related probability of its associated failure mode.

4. The method of claim 1, wherein the unsequenced repair procedures are associated with failure modes that are addressed by the isolation procedure but which have been previously unaddressed.

5. The method of claim 1, further comprising determining failure modes addressed by the last corrective action sequenced that have been previously unaddressed.

6. The method of claim 5, further comprising recalculating the probabilities of resolution related to failure modes that are yet unaddressed.

7. The method of claim 1 wherein a corrective action may resolve multiple failure modes.

8. The method of claim 6 wherein after being sequenced into the maintenance plan sequence, the corrective action remains related to an unaddressed failure mode but with a new probability of resolution that is equal to 100% minus the original probability of resolution of the associated failure mode.

9. A non-transitory computer readable medium containing instruction recorded thereon that when executed by a computing device carry out acts for determining a minimum cost maintenance plan for correcting a casualty in a complex machine, comprising:

receive ambiguity group information comprising a plurality of failure modes of an ambiguity group associated with the casualty, their related probabilities of resolution and related corrective actions for each failure mode of the plurality, wherein a corrective action is one of a repair procedure and an isolation procedure;

determine the lowest cost corrective action within the ambiguity group;

when the lowest cost corrective action is a repair procedure, then sequence the repair procedure into a maintenance plan sequence of corrective actions;

when the lowest cost corrective action is an isolation procedure, then;

determine if any combination and permutation of all unsequenced repair procedures associated with the ambiguity group have a lower cost than the combined cost of the isolation procedure and its associated repair procedure,

when one of a combination and permutation of all unsequenced repair procedures has the lower cost, then sequence a first repair procedure in the sequence of the one of a combination and permutation into the maintenance plan sequence of corrective actions,

when no combination and permutation of all unsequenced repair procedures has the lower cost, then sequence the isolation procedure in the maintenance plan sequence of the one of a combination and permutation into the maintenance plan sequence of corrective actions; and

repeat the determining step until all failure mode corrective actions have been sequenced into the maintenance plan sequence.

10. The computer readable medium of claim 9, wherein the failure mode related probabilities are normalized probabilities.

11. The computer readable medium of claim 10, wherein the lowest cost corrective action is determined after adjusting the cost of the corrective action by dividing the cost of the corrective action by the normalized related probability of its associated failure mode.

12. The computer readable medium of claim 9, wherein the unsequenced repair procedures are associated with failure modes that are addressed by the isolation procedure but which have been previously unaddressed.

13. The computer readable medium of claim 9, further comprising instructions to determine failure modes addressed by the last corrective action sequenced that have been previously unaddressed.

14. The computer readable medium of claim 13, further comprising instructions to recalculate the probabilities of resolution related to failure modes that are yet unaddressed.

15. The computer readable medium of claim 9 wherein a corrective action may resolve multiple failure modes.

16. The computer readable medium of claim 14 wherein after being sequenced into the maintenance plan sequence, the corrective action remains related to an unaddressed failure mode but with a new probability of resolution that is equal to 100% minus the original probability of resolution of the associated failure mode.

17. A system for determining a minimum cost maintenance plan for correcting a casualty in a complex machine, comprising:

a database containing ambiguity group information comprising a plurality of failure modes associated with the casualty, their related probabilities of resolution and related corrective actions for each failure mode of the plurality, wherein a corrective action is one of a repair procedure and an isolation procedure; and

a processor in operable communication with the database, the processor executing instructions to;

receive ambiguity group information from the database;

determine the lowest cost corrective action within the ambiguity group;

when the lowest cost corrective action is a repair procedure, then sequence the repair procedure into a maintenance plan sequence of corrective actions;

when the lowest cost corrective action is an isolation procedure, then;

determine if any combination and permutation of all unsequenced repair procedures associated with the ambiguity group have a lower cost than the combined cost of the isolation procedure and its associated repair procedure,

when one of a combination and permutation of all unsequenced repair procedures has the lower cost, then sequence a first repair procedure in the sequence of the one of a combination and permutation into the maintenance plan sequence of corrective actions,

when no combination and permutation of all unsequenced repair procedures has the lower cost, then sequence the isolation procedure in the maintenance plan sequence of the one of a combination and permutation into the maintenance plan sequence of corrective actions; and

repeat the determine step until all failure mode corrective actions have been sequenced into the maintenance plan sequence.