面向客户的不可靠服务系统群体维护模型

Gia-Shie Liu
{"title":"面向客户的不可靠服务系统群体维护模型","authors":"Gia-Shie Liu","doi":"10.1109/INDIN.2008.4618097","DOIUrl":null,"url":null,"abstract":"This study considers a service system with multiple independent servers operating in parallel and a single Markovian queue. The servers are unreliable with identically exponentially distributed failure times but no server failures allowed during maintenance. The repair time is also assumed to follow exponential distribution. Accordingly, we formulate this model as a continuous time Markov decision process. Group maintenance policies are developed based on the number of customers dynamically in the queue, and are mathematically proved to have the property of threshold structure.","PeriodicalId":112553,"journal":{"name":"2008 6th IEEE International Conference on Industrial Informatics","volume":"186 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Customer-oriented group maintenance model for unreliable service system\",\"authors\":\"Gia-Shie Liu\",\"doi\":\"10.1109/INDIN.2008.4618097\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This study considers a service system with multiple independent servers operating in parallel and a single Markovian queue. The servers are unreliable with identically exponentially distributed failure times but no server failures allowed during maintenance. The repair time is also assumed to follow exponential distribution. Accordingly, we formulate this model as a continuous time Markov decision process. Group maintenance policies are developed based on the number of customers dynamically in the queue, and are mathematically proved to have the property of threshold structure.\",\"PeriodicalId\":112553,\"journal\":{\"name\":\"2008 6th IEEE International Conference on Industrial Informatics\",\"volume\":\"186 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-07-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 6th IEEE International Conference on Industrial Informatics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INDIN.2008.4618097\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 6th IEEE International Conference on Industrial Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INDIN.2008.4618097","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文研究了一个具有多个独立服务器并行运行和单个马尔可夫队列的服务系统。服务器不可靠,故障时间呈指数分布,但在维护期间不允许出现服务器故障。同时假定维修时间服从指数分布。因此,我们将该模型表述为一个连续时间马尔可夫决策过程。根据队列中顾客的数量动态地制定了群体维护策略,并在数学上证明了该策略具有阈值结构的性质。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Customer-oriented group maintenance model for unreliable service system
This study considers a service system with multiple independent servers operating in parallel and a single Markovian queue. The servers are unreliable with identically exponentially distributed failure times but no server failures allowed during maintenance. The repair time is also assumed to follow exponential distribution. Accordingly, we formulate this model as a continuous time Markov decision process. Group maintenance policies are developed based on the number of customers dynamically in the queue, and are mathematically proved to have the property of threshold structure.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信