Machine diagnosis and maintenance policy generation using adaptive decision tree and shortest path problem

Machine diagnosis and maintenance policy generation using adaptive decision tree and shortest path problem

0.00 Avg rating0 Votes
Article ID: iaor2003470
Country: South Korea
Volume: 27
Issue: 2
Start Page Number: 33
End Page Number: 50
Publication Date: Jun 2002
Journal: Journal of the Korean ORMS Society
Authors:
Keywords: programming: critical path, scheduling, networks
Abstract:

CBM (Condition-Based Maintenance) has increasingly drawn attention in industry because of its many benefits. CBM problem is characterized as a state-dependent scheduling model that demands simultaneous maintenance actions, each for an attribute that influences machine condition. This problem is very hard to solve within conventional Markov decision process framework. In this paper, we present an intelligent machine maintenance scheduler, for which a new incremental decision tree learning method as evolutionary system identification model and shortest path problem as schedule generation model are developed. Although our approach does not guarantee an optimal scheduling policy in mathematical viewpoint, we verified through simulation based experiment that the intelligent scheduler is capable of providing good scheduling policy that can be used in practice.

Reviews

Required fields are marked *. Your email address will not be published.