Optimal (s,S) policies for manufacturing systems of unreliable machines in tandem

W. Ching
{"title":"Optimal (s,S) policies for manufacturing systems of unreliable machines in tandem","authors":"W. Ching","doi":"10.1109/RAMS.1998.653805","DOIUrl":null,"url":null,"abstract":"This paper studies optimal (s,S) policies for production planning in manufacturing systems of unreliable machines in tandem. The manufacturing system produces one type of product. This type of manufacturing system occurs in many applications. In our study we assume that the inter-arrival time of a demand and processing time for one product in each machine are exponentially distributed. Each machine is unreliable and is subject to a sequence of repairing processes when it is broken down. The up time and the repairing time in each phase are assumed to be exponentially distributed. We study the manufacturing system by considering each machine as an individual system with random supply and demand. The Markov Modulated Poisson Process (MMPP) is used to model the random process of supply. For each machine, we obtain the approximated optimal (s,S) policies which minimizes the average running cost of its buffer.","PeriodicalId":275301,"journal":{"name":"Annual Reliability and Maintainability Symposium. 1998 Proceedings. International Symposium on Product Quality and Integrity","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annual Reliability and Maintainability Symposium. 1998 Proceedings. International Symposium on Product Quality and Integrity","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RAMS.1998.653805","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

This paper studies optimal (s,S) policies for production planning in manufacturing systems of unreliable machines in tandem. The manufacturing system produces one type of product. This type of manufacturing system occurs in many applications. In our study we assume that the inter-arrival time of a demand and processing time for one product in each machine are exponentially distributed. Each machine is unreliable and is subject to a sequence of repairing processes when it is broken down. The up time and the repairing time in each phase are assumed to be exponentially distributed. We study the manufacturing system by considering each machine as an individual system with random supply and demand. The Markov Modulated Poisson Process (MMPP) is used to model the random process of supply. For each machine, we obtain the approximated optimal (s,S) policies which minimizes the average running cost of its buffer.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
串联不可靠机器制造系统的最优(s, s)策略
研究了不可靠机器串联制造系统生产计划的最优(s, s)策略。制造系统只生产一种产品。这种类型的制造系统出现在许多应用中。在我们的研究中,我们假设需求的间隔到达时间和每台机器中一种产品的加工时间呈指数分布。每台机器都是不可靠的,当它发生故障时,都要经过一系列的修理过程。假设各相位的启动时间和修复时间呈指数分布。我们研究制造系统时,把每台机器看作一个具有随机供给和需求的独立系统。采用马尔可夫调制泊松过程(MMPP)对随机供给过程进行建模。对于每台机器,我们获得近似的最优(s, s)策略,使其缓冲区的平均运行成本最小化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Virtual maintenance real-world applications within virtual environments Integrated design method for probabilistic design Parameter estimation for mixed-Weibull distribution Tailoring ESS strategies for effectiveness and efficiency Prediction of tensile-strength distribution of optical fibers
×
引用
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