A study on ally searching in maintenance alliance based on relation web model

2Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Aiming at the risk aversion of adverse selection and efficiency improvement in maintenance ally searching, relation web and Mobile Agent are introduced into the study of maintenance ally searching. A maintenance ally searching method based on relation web model is proposed. First, the method decomposes complicated plant maintenance tasks, and then by setting up ally Searching Sub-Agent, the relation web model is mapped as properties, plans, behaviours and interactions of the Searching Sub-Agent. Based on the relation categories, shortest path, reliability and other definitions in relation to web model, a quantified evaluation method for acquaintance reliability and capability in maintenance alliance and ally searching strategy are designed. A solution for recommendation deadlock and dynamic management of Searching Sub-Agent is discussed. The ally searching system in maintenance alliance based on the above method is effectively applied in a plant overhaul of a partner petrochemical company. Copyright © 2011 Inderscience Enterprises Ltd.

Cite

CITATION STYLE

APA

Xia, B. Z., Liu, J., Yu, D. J., & Zhou, A. M. (2011). A study on ally searching in maintenance alliance based on relation web model. International Journal of Industrial and Systems Engineering, 9(4), 412–433. https://doi.org/10.1504/IJISE.2011.043484

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free