頁籤選單縮合
題名 | M(1,2)/G(1,2)/1/(L[feb5]L[feaf]) Queue with Markov Dependent Shift in Service= |
---|---|
作者 | Rajagopalan,V.; Krishnamoorthy,A.; |
期刊 | International Journal of Information and Management Sciences |
出版日期 | 19980300 |
卷期 | 9:1 1998.03[民87.03] |
頁次 | 頁1-9 |
分類號 | 494.59 |
語文 | eng |
關鍵詞 | Markov renewal process; Semi markov process; Markov dependent service; Optimization problem; |
英文摘要 | We consider a queueing process with a single server where the inputs form two different streams. Inputs to these two streams are independent Poisson processes of rates λ and λ respectively. Service times for the two streams have distributions G and G respectively. There is only one server. He selects units to be served according to a Markov Chain Rule from the two streams, only one customer is served at a time. We assume that the system can accommodate a maximum of L of Type-1 and L of Type-2 in the respective waiting lines. The time dependent and steady state system state probabilities are obtained. In addition from a given set of Markov chains determining the type of customer to be served the one that minimizes the total cost is identified. This model generalizes the alternating and priority queues. |
本系統之摘要資訊系依該期刊論文摘要之資訊為主。