PREVENTIVE MAINTENANCE POLICY FOR LINEAR CONSECUTIVE-K-OUT-OF-N: F SYSTEM

A. Endharta, W. Yun, Hisashi Yamamoto
{"title":"PREVENTIVE MAINTENANCE POLICY FOR LINEAR CONSECUTIVE-K-OUT-OF-N: F SYSTEM","authors":"A. Endharta, W. Yun, Hisashi Yamamoto","doi":"10.15807/JORSJ.59.334","DOIUrl":null,"url":null,"abstract":"Linear consecutive- k -out-of- n : F systems are considered. It is assumed that the components are independent and the component failure times follow an exponential distribution with identical failure rate. It is also assumed that there are only two component states (working and failed) and we can know the component state at any time. If there is at least one minimal cut set consisting of one working component, the system will be preventively maintained after a certain time interval. If the system fails before reaching the preventive maintenance (PM) time, the failed components are replaced by the new ones. The optimal PM interval time which minimizes the expected cost rate is obtained. The performance of the proposed policy is evaluated by comparing the expected cost rate of the proposed policy with those of corrective maintenance (CM) and age PM policy.","PeriodicalId":51107,"journal":{"name":"Journal of the Operations Research Society of Japan","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.15807/JORSJ.59.334","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of the Operations Research Society of Japan","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15807/JORSJ.59.334","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Decision Sciences","Score":null,"Total":0}
引用次数: 13

Abstract

Linear consecutive- k -out-of- n : F systems are considered. It is assumed that the components are independent and the component failure times follow an exponential distribution with identical failure rate. It is also assumed that there are only two component states (working and failed) and we can know the component state at any time. If there is at least one minimal cut set consisting of one working component, the system will be preventively maintained after a certain time interval. If the system fails before reaching the preventive maintenance (PM) time, the failed components are replaced by the new ones. The optimal PM interval time which minimizes the expected cost rate is obtained. The performance of the proposed policy is evaluated by comparing the expected cost rate of the proposed policy with those of corrective maintenance (CM) and age PM policy.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
线性连续- k - of - n: f系统的预防性维护策略
考虑线性连续- k -out- n: F系统。假设各部件是独立的,各部件的失效次数服从相同故障率的指数分布。同时假设组件只有两种状态(工作状态和故障状态),我们可以随时知道组件的状态。如果至少有一个由一个工作部件组成的最小切割集,则系统将在一定的时间间隔后进行预防性维护。如果在巡检时间前系统出现故障,则更换故障部件。得到了使期望成本率最小的最优维修间隔时间。通过将建议策略的预期成本率与纠正维护(CM)和老化PM策略的预期成本率进行比较,可以评估建议策略的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Journal of the Operations Research Society of Japan
Journal of the Operations Research Society of Japan 管理科学-运筹学与管理科学
CiteScore
0.70
自引率
0.00%
发文量
12
审稿时长
12 months
期刊介绍: The journal publishes original work and quality reviews in the field of operations research and management science to OR practitioners and researchers in two substantive categories: operations research methods; applications and practices of operations research in industry, public sector, and all areas of science and engineering.
期刊最新文献
IMPLEMENTING ARROW–DEBREU EQUILIBRIA IN APPROXIMATELY COMPLETE SECURITY MARKETS A RIEMANNIAN-GEOMETRICAL APPROACH TO STRICTLY CONVEX QUADRATIC PROGRAMMING WITH CONVEXITY-PRESERVING METRIC PARAMETERIZATION A SUBGEOMETRIC CONVERGENCE FORMULA FOR TOTAL-VARIATION ERROR OF THE LEVEL-INCREMENT TRUNCATION APPROXIMATION OF M/G/1-TYPE MARKOV CHAINS MIXED-INTEGER DC PROGRAMMING BASED ALGORITHMS FOR THE CIRCULAR PACKING PROBLEM A HYBRID ALGORITHM FOR THE ADWORDS PROBLEM
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1