Global search algorithm for automated maintenance planning and scheduling of parts requests

Authors:
Ravindra Patankar;Roger Xu;Hongda Chen;David Patterson
Affiliations:
Intelligent Automation, Inc., Rockville, MD, USA;Intelligent Automation, Inc., Rockville, MD, USA;Intelligent Automation, Inc., Rockville, MD, USA;Intelligent Automation, Inc., Rockville, MD, USA
Venue:
Computers and Operations Research
Year:
2009

Citing 6
Cited 0

Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems

Artificial Intelligence - Special volume on constraint-based reasoning
Modern heuristic techniques for combinatorial problems

Modern heuristic techniques for combinatorial problems
Genetic algorithms + data structures = evolution programs (3rd ed.)

Genetic algorithms + data structures = evolution programs (3rd ed.)
A memetic algorithm to schedule planned maintenance for the national grid

Journal of Experimental Algorithmics (JEA)
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Combinatorial optimization by stochastic evolution

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

The work content variability in a shop or field maintenance system is significant. The key to efficient maintenance operation is an effective diagnostic system that narrows the problem to a small ambiguity group, explicit mechanisms to leverage the knowledge of repairs and isolation tests that would be useful to fix the ambiguous fault condition and immediate communication with the parts store regarding availability of parts. Such scenario calls for the concept of dynamic optimization, which seeks optimal solutions to maintenance planning and scheduling problems subject to the dynamics such as outcomes of isolation tests or repair actions already execute to fix the ambiguous fault condition. This paper presents a global search algorithm to solve this dynamic optimization problem. An objective function is derived that takes into account the cost of parts that might be used for maintenance, the restocking fee for the parts that might be ordered and returned because they are not used, the labor cost of maintenance and the cost of waiting for ordered parts to be delivered. The global search algorithm was found to perform at satisfactory speeds for ambiguity groups containing up to five repairs. This covers majority of the cases in the field.