修改离散预防性维护策略

T. Nakagawa
{"title":"修改离散预防性维护策略","authors":"T. Nakagawa","doi":"10.1002/NAV.3800330413","DOIUrl":null,"url":null,"abstract":"This article proposes a modified preventive maintenance (PM) policy which may be done only at scheduled times nT (n = 1,2, …): The PM is done at the next such time if and only if the total number of failures exceeds a specified number k. The optimal number k* to minimize the expected cost rate is discussed. Further, four alternative similar PM models are considered, when the system fails due to a certain number of faults, uses, shocks, and unit failures.","PeriodicalId":431817,"journal":{"name":"Naval Research Logistics Quarterly","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1986-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":"{\"title\":\"Modified discrete preventive maintenance policies\",\"authors\":\"T. Nakagawa\",\"doi\":\"10.1002/NAV.3800330413\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This article proposes a modified preventive maintenance (PM) policy which may be done only at scheduled times nT (n = 1,2, …): The PM is done at the next such time if and only if the total number of failures exceeds a specified number k. The optimal number k* to minimize the expected cost rate is discussed. Further, four alternative similar PM models are considered, when the system fails due to a certain number of faults, uses, shocks, and unit failures.\",\"PeriodicalId\":431817,\"journal\":{\"name\":\"Naval Research Logistics Quarterly\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1986-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Naval Research Logistics Quarterly\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1002/NAV.3800330413\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Naval Research Logistics Quarterly","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/NAV.3800330413","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 17

摘要

本文提出了一种改进的预防性维护(PM)策略,该策略只能在计划时间nT (n = 1,2,…)进行:当且仅当故障总数超过指定数量k时,在下一个这样的时间进行PM。讨论了使期望成本率最小的最优k*。此外,当系统由于一定数量的故障、使用、冲击和单元故障而失效时,考虑了四种类似的可选PM模型。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Modified discrete preventive maintenance policies
This article proposes a modified preventive maintenance (PM) policy which may be done only at scheduled times nT (n = 1,2, …): The PM is done at the next such time if and only if the total number of failures exceeds a specified number k. The optimal number k* to minimize the expected cost rate is discussed. Further, four alternative similar PM models are considered, when the system fails due to a certain number of faults, uses, shocks, and unit failures.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
On estimating population characteristics from record‐breaking observations. i. parametric results Optimal replacement for fault‐tolerant systems Algorithms for the minimax transportation problem Nature of renyi's entropy and associated divergence function Rescheduling to minimize makespan on a changing number of identical processors
×
引用
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