A transient solution of queues with variable channel considering balking concept when \(S\) = 2 and \(\sigma\) = 1 (Q2490211): Difference between revisions

The paper considers a process in which arrivals and services are in the steady state and are exponentially distributed, arrivals form in a single queue under strict queue discipline. The minimum number of service channels which are manned is designated by \(\sigma \). When all of these channels are busy and the number of units waiting in the queue reaches a critical value \(N\), then an additional channel is assumed to open instantaneously, and immediately the queue length reduces to \(N - 1\). If while \(\sigma + 1\) channels are in operation, the queue length should again reach \(N\), another channel opens again reducing the queue to \(N - 1\). This process of increasing the number of channels may continue until the maximum allowable number of channels, \(S\), is in operation, then no increase in the number of channels is possible and the queue is allowed to grow without bound. A reduction in the number of operating channels may take place only if the queue length is equal to \(\nu \), where \(\nu \geqslant 0\), a service completion occurs. The channel that completed the service is then cancelled. The reduction process may continue until the minimum allowable number, \(\sigma \), of channels is reached. The paper obtains the non-stationary probabilities of the queue when \(S = 2\) and \(\sigma = 1\).