A Service with Arrivals Depending on its Neighboring Queue
In this presentation we propose a queueing system that consists of two waiting lines,namely M-lane ane N-lane.Two independent Poisson arrivals and exponential services are assumed.However the arrival process of M-lane may depend on the waiting information at N-lane.When the queue length of N-lane is less than an integer m there is a proportional arrival of M-lane joins the N-lane service with probability .Otherwise two arrival processes are not mutually interfered.The waiting space at N-lane is finite but it is infinite at M-lane.N-lane may loss customers who leave without receiving service when the waiting space in N-lane is full.All arriving customers stay in the system until they are served where services are independent of arrivals.We derive stationary probabilities of number of customers at M-lane with proofs and give numerical illustration for verification.
Queuing models Markov chains Stationary probabilities MAP
Chen-Hsu Lin Feng-Yun Chung Hsing Luh
Department of Mathematical Sciences ChengChi University,Wenshan Taiwan
国际会议
河北秦皇岛
英文
95-98
2017-08-21（万方平台首次上网日期，不代表论文的发表时间）