Open Access. Powered by Scholars. Published by Universities.®
Operations Research, Systems Engineering and Industrial Engineering Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering
Multi-Threshold Control Of The Bmap/Sm/1/K Queue With Group Services, Alexander Dudin N., Srinivas R. Chakravarthy
Multi-Threshold Control Of The Bmap/Sm/1/K Queue With Group Services, Alexander Dudin N., Srinivas R. Chakravarthy
Industrial & Manufacturing Engineering Publications
We consider a finite capacity queue in which arrivals occur according to a batch Markovian arrival process (BMAP). The customers are served in groups of varying sizes. The services are governed by a controlled semi-Markovian process according to a multithreshold strategy. We perform the steady-state analysis of this model by computing (a) the queue length distributions at departure and arbitrary epochs, (b) the Laplace-Stieltjes transform of the sojourn time distribution of an admitted customer, and (c) some selected system performance measures. An optimization problem of interest is presented and some numerical examples are illustrated.
Two Parallel Finite Queues With Simultaneous Services And Markovian Arrivals, Srinivas R. Chakravarthy, S. Thiagarajan
Two Parallel Finite Queues With Simultaneous Services And Markovian Arrivals, Srinivas R. Chakravarthy, S. Thiagarajan
Industrial & Manufacturing Engineering Publications
In this paper, we consider a finite capacity single server queueing model with two buffers, A and B, of sizes K and N respectively. Messages arrive one at a time according to a Markovian arrival process. Messages that arrive at buffer A are of a different type from the messages that arrive at buffer B. Messages are processed according to the following rules: 1. When buffer A(B) has a message and buffer B(A) is empty, then one message from A(B) is processed by the server. 2. When both buffers, A and B, have messages, then two messages, one from A …