{"title":"有限容量马尔可夫队列的最优性(带受阻到达和带等待服务器的单一队列","authors":"J. Vimal Andrew","doi":"10.52783/cana.v31.1052","DOIUrl":null,"url":null,"abstract":"We consider finite-capacity Markovian queues with a single hiatus scheme and waiting server. Customers are arriving at a Poisson arrival λ and exponential service distribution, with a mean service rate µ. In which customers join the queue according to the number of customers in the system while the hiatus is in the service-providing process. For the assumed queuing model, steady-state probabilities were derived, and some important performance measures, such as the mean number of customers in the system and mean response time in the system and queue are analysed. The expected expense function is developed and formulated as an optimization problem in order to find the minimum expense. Numerical illustrations are given to show the effect of parameters on the performance measures.","PeriodicalId":40036,"journal":{"name":"Communications on Applied Nonlinear Analysis","volume":" 15","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimality of Finite Capacity Markovian Queues with Discouraged Arrivals and Singlhiatus with Waiting Server\",\"authors\":\"J. Vimal Andrew\",\"doi\":\"10.52783/cana.v31.1052\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider finite-capacity Markovian queues with a single hiatus scheme and waiting server. Customers are arriving at a Poisson arrival λ and exponential service distribution, with a mean service rate µ. In which customers join the queue according to the number of customers in the system while the hiatus is in the service-providing process. For the assumed queuing model, steady-state probabilities were derived, and some important performance measures, such as the mean number of customers in the system and mean response time in the system and queue are analysed. The expected expense function is developed and formulated as an optimization problem in order to find the minimum expense. Numerical illustrations are given to show the effect of parameters on the performance measures.\",\"PeriodicalId\":40036,\"journal\":{\"name\":\"Communications on Applied Nonlinear Analysis\",\"volume\":\" 15\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-07-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Communications on Applied Nonlinear Analysis\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.52783/cana.v31.1052\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Communications on Applied Nonlinear Analysis","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.52783/cana.v31.1052","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
Optimality of Finite Capacity Markovian Queues with Discouraged Arrivals and Singlhiatus with Waiting Server
We consider finite-capacity Markovian queues with a single hiatus scheme and waiting server. Customers are arriving at a Poisson arrival λ and exponential service distribution, with a mean service rate µ. In which customers join the queue according to the number of customers in the system while the hiatus is in the service-providing process. For the assumed queuing model, steady-state probabilities were derived, and some important performance measures, such as the mean number of customers in the system and mean response time in the system and queue are analysed. The expected expense function is developed and formulated as an optimization problem in order to find the minimum expense. Numerical illustrations are given to show the effect of parameters on the performance measures.