基于Petri网的轨道顾客搜索排队库存系统的随机分析

Lyes Ikhlef, Sedda Hakmi, Ouiza Lekadir, D. Aïssani
{"title":"基于Petri网的轨道顾客搜索排队库存系统的随机分析","authors":"Lyes Ikhlef, Sedda Hakmi, Ouiza Lekadir, D. Aïssani","doi":"10.1109/ICRAMI52622.2021.9585961","DOIUrl":null,"url":null,"abstract":"We analyze the (s, S) replenishment policy for a queueing inventory system with a finite sources, service time and customers search from the orbit. Assuming the search time to be negligible, detailed Generalized Stochastic Petri Net (GSPN) model which copes with the complexity of this inventory system is given. The probability distribution of this system is obtained. Using this probability distribution, we compute some measures and the expected cost rate.","PeriodicalId":440750,"journal":{"name":"2021 International Conference on Recent Advances in Mathematics and Informatics (ICRAMI)","volume":"530 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Stochastic Analysis of a queueing inventory system with customers search from the orbit using Petri nets\",\"authors\":\"Lyes Ikhlef, Sedda Hakmi, Ouiza Lekadir, D. Aïssani\",\"doi\":\"10.1109/ICRAMI52622.2021.9585961\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We analyze the (s, S) replenishment policy for a queueing inventory system with a finite sources, service time and customers search from the orbit. Assuming the search time to be negligible, detailed Generalized Stochastic Petri Net (GSPN) model which copes with the complexity of this inventory system is given. The probability distribution of this system is obtained. Using this probability distribution, we compute some measures and the expected cost rate.\",\"PeriodicalId\":440750,\"journal\":{\"name\":\"2021 International Conference on Recent Advances in Mathematics and Informatics (ICRAMI)\",\"volume\":\"530 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-09-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 International Conference on Recent Advances in Mathematics and Informatics (ICRAMI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICRAMI52622.2021.9585961\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Conference on Recent Advances in Mathematics and Informatics (ICRAMI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICRAMI52622.2021.9585961","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

分析了资源有限、服务时间有限、顾客从轨道上搜索的排队库存系统的(s, s)补货策略。假设搜索时间可以忽略不计,给出了处理该库存系统复杂性的广义随机Petri网(GSPN)模型。得到了该系统的概率分布。利用这个概率分布,我们计算了一些度量和期望成本率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Stochastic Analysis of a queueing inventory system with customers search from the orbit using Petri nets
We analyze the (s, S) replenishment policy for a queueing inventory system with a finite sources, service time and customers search from the orbit. Assuming the search time to be negligible, detailed Generalized Stochastic Petri Net (GSPN) model which copes with the complexity of this inventory system is given. The probability distribution of this system is obtained. Using this probability distribution, we compute some measures and the expected cost rate.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信