{"title":"重试排队库存系统的随机分解","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":"{\"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}","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}
Stochastic Decomposition in Retrial Queueing Inventory System
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.