SYSTEMS AND METHODS FOR THE SOLUTION TO THE JOINT PROBLEM OF PARTS ORDER SCHEDULING AND MAINTENANCE PLAN GENERATION FOR FIELD MAINTENANCE

• US 20130173329A1
• Filed: 01/04/2012
• Published: 07/04/2013
• Est. Priority Date: 01/04/2012
• Status: Abandoned Application

• Current Assignee: Honeywell International Inc.
• Original Assignee: Honeywell International Inc.
• Inventors: Kolbet, David Michael, Patankar, Ravindra, Magnuson, Randy R.
• Application Number:
  US13/343,524
• Publication Number:
  US 20130173329A1
• Time in Patent Office: Days
• US Class Current: 705/7.25
• CPC Class Codes: G06Q 10/20 Administration of product repair or maintenance

Abstract

Methods and apparatus are provided for selecting a maintenance plan such that the cost of the maintenance plan is the lowest or near the lowest. The method comprises receiving a set of maintenance actions, wherein one of the repair actions is likely to repair the failure mode. The set of maintenance actions is sequenced in the increasing order of their waiting times. 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 first requisition and a second requisition by assigning each of the sequence of maintenance actions to one of the first or the second requisition.

Claims

1. ) A method for minimizing the cost of a maintenance plan for correcting a failure mode of a casualty in a complex machine, comprising:

receiving a plurality of maintenance actions related to the failure mode, wherein one of the maintenance actions of the plurality is likely to repair the failure mode, each maintenance action having 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;

constructing a plurality of different maintenance plans each comprising a sequence of the maintenance actions by assigning zero or more of the maintenance actions of the sequence with the longest of the waiting times to a second requisition, wherein each maintenance plan includes a first requisition and the second requisition;

calculating an associated cost of each maintenance plan; and

determining which of the associated cost maintenance plans is lowest.

2. ) The method of claim 1, wherein the waiting time cost of a maintenance plan equals the longest waiting time cost of all of the maintenance actions assigned to the primary requisition plus a probability weighted average waiting cost of all the maintenance actions assigned to the secondary requisition, wherein each probability weight is the probability that each of the failure modes is the underlying cause of the casualty.

3. ) The method of claim 2, wherein the sum of all probability weights of all of the failure modes equals 100%.

4. ) The method of claim 1, wherein the likelihood of isolating and repairing the failure mode by a maintenance action related to the failure mode is 100%.

5. ) The method of claim 4, wherein when the maintenance action with the longest wait time cost is an isolation action, then deleting the isolation action.

6. ) The method of claim 4 wherein the execution time cost is equal to the average total execution time cost for the maintenance plan.

7. ) The method of claim 6, wherein the average total execution time cost is equal to the probability weighted sum of all of the execution time costs for each action in the sequence of maintenance actions, wherein each probability weight is the probability that each respective maintenance action will need to be executed while following the action sequence in the maintenance plan.

8. ) The method of claim 4, wherein the average total material cost is equal to a probability weighted average material cost where the probability is that the material will need to be requisitioned for the repair.

9. ) The method of claim 8, wherein the weighted average material cost is equal to the probability weighted sum of all of the material costs for each action in the sequence of maintenance actions, wherein each probability weight is the probability that each respective action will need to be executed while following the action sequence in the maintenance plan.

10. ) A method for determining a minimum cost maintenance plan for correcting a failure mode in a complex machine, comprising:

receiving a sequence of maintenance actions in an increasing 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 having 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 resources required to perform the maintenance action; and

constructing a maintenance plan comprising a first requisition and a second requisition by assigning each of the maintenance actions in the sequence of maintenance actions to the first or second requisition.

11. ) The method of claim 10, further comprising dropping the maintenance action with the largest wait time cost from the maintenance plan when the maintenance action with the longest wait time cost in the sequence of maintenance actions is an isolation action.

12. ) The method of claim 11, further comprising placing each of the maintenance actions in the sequence in a first requisition to generate a first plan and determining the total cost of the first plan.

13. ) The method of claim 12, further comprising, displacing the maintenance action with the largest wait time cost from the first requisition to a second requisition to generate a subsequent plan and determining the total cost of the subsequent plan, the first plan becoming a previous plan.

14. ) The method of claim 13, further comprising:

(a) determining whether the total cost of the subsequent plan has a lower total cost than the previous plan; and

(b) rendering the previous plan to a user when the subsequent plan has a higher total cost than the previous plan.

15. ) The method of claim 14, further comprising:

(c) displacing the maintenance action from the sequence with next largest wait time cost from the first requisition into the second requisition when the total cost of the subsequent plan is lower than the total cost of the previous plan to create another subsequent plan and the subsequent plan then becoming the previous plan; and

(d) repeating steps (a-d) until the total cost of the subsequent plan is not lower than the total cost of the previous plan.

16. ) A computer readable medium with instructions stored thereon that when executed by a computing device causes acts to be performed, the acts comprising:

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 having 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;

constructing a plurality of different maintenance plans from the sequence of maintenance actions, each maintenance plan including a first requisition and a second requisition, by assigning zero or more of the maintenance actions of the sequence with the longest of the waiting times to the secondary requisition;

calculating an associated cost of each maintenance plan; and

determining which of the associated cost maintenance plan is lowest.

17. ) The method of claim 16, wherein the waiting time cost of a maintenance plan equals the longest waiting time cost of all of the maintenance actions assigned to the first requisition plus a probability weighted average waiting cost of all the maintenance actions assigned to the second requisition, wherein each probability weight is the probability that each respective maintenance action repairs the failure mode.

18. ) The method of claim 17, wherein the sum of all probability weights of individual failure modes being the cause of the underlying casualty equals 100%.

19. ) The method of claim 16, wherein the maintenance actions are one of a repair action and an isolation action.

20. ) The method of claim 17, wherein when the maintenance action with the longest wait time cost is an isolation action, then deleting the isolation action.