Stochastic Decomposition in Retrial Queueing Inventory System

A. Krishnamoorthy, D. Shajin
{"title":"Stochastic Decomposition in Retrial Queueing Inventory System","authors":"A. Krishnamoorthy, D. Shajin","doi":"10.1145/3016032.3016043","DOIUrl":null,"url":null,"abstract":"The purpose of this paper is to obtain product form solution for retrial - queueing - inventory system. We study an M/M/1 retrial queue with a storage system driven by an (s, S) policy. When server is idle, external arrivals enter directly to an orbit. Inventory replenishment lead time is exponentially distributed. The interval between two successive repeat attempts is exponentially distributed and only the customer at the head of the orbit is permitted to access the server. No customer is allowed to join the orbit when the storage system is empty and also when the serer is busy. We first derive the stationary joint distribution of the queue length and the on-hand inventory in explicit product form. Using the joint distribution, we investigate long-run performance measures and a cost function. The optimal pair (s, S) is numerically investigated.","PeriodicalId":269685,"journal":{"name":"Proceedings of the 11th International Conference on Queueing Theory and Network Applications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 11th International Conference on Queueing Theory and Network Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3016032.3016043","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

Abstract

The purpose of this paper is to obtain product form solution for retrial - queueing - inventory system. We study an M/M/1 retrial queue with a storage system driven by an (s, S) policy. When server is idle, external arrivals enter directly to an orbit. Inventory replenishment lead time is exponentially distributed. The interval between two successive repeat attempts is exponentially distributed and only the customer at the head of the orbit is permitted to access the server. No customer is allowed to join the orbit when the storage system is empty and also when the serer is busy. We first derive the stationary joint distribution of the queue length and the on-hand inventory in explicit product form. Using the joint distribution, we investigate long-run performance measures and a cost function. The optimal pair (s, S) is numerically investigated.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
重试排队库存系统的随机分解
本文的目的是得到重审排队库存系统的产品形态解。研究了一个由(s, s)策略驱动的存储系统的M/M/1重试队列。当服务器空闲时,外部到达直接进入轨道。库存补货提前期呈指数分布。两次连续重复尝试之间的间隔呈指数分布,并且只允许位于轨道头部的客户访问服务器。当存储系统为空或服务器繁忙时,不允许客户加入轨道。首先以显积形式导出了排队长度与库存的平稳联合分布。利用联合分布,我们研究了长期绩效指标和成本函数。对最优对(s, s)进行了数值研究。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Online Detection of Behavioral Change Using Unobtrusive Eldercare Monitoring System Light-traffic analysis of queues with limited heterogenous retrials Modeling of Priority-based Request Scheduling Mechanism for Finite Buffer SIP Servers Dynamic Task Scheduling for Energy Harvesting Nodes in Wireless Sensor Networks Variability of output in two-node tandem production line
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1