Systems and methods for creating a near optimal maintenance plan
First Claim
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.
4 Assignments
0 Petitions
Accused Products
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.
-
Citations
17 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. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
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. - View Dependent Claims (10, 11, 12, 13, 14, 15, 16)
-
-
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.
-
Specification