A Finite Capacity Resequencing Model with Markovian Arrivals
Document Type
Article
Publication Date
9-1-2005
Publication Title
Asia-Pacific Journal of Operational Research
Abstract
In this paper, we consider a two-server finite capacity queuing model in which messages should leave the system in the order in which they entered the system. Messages arrive according to a Markovian arrival process (MAP) and any message finding the buffer full is considered lost. Out-of-sequence messages are stored in a (finite) buffer and may lead to blocking when a processed message cannot be placed in the buffer. The steady state analysis of the model is performed by exploiting the structure of the coefficient matrices. The departure process is characterized and two interesting optimization problems along with illustrative numerical examples are discussed. Read More: http://www.worldscientific.com/doi/abs/10.1142/S0217595905000613
Volume
22
Issue
3
First Page
409
Last Page
443
DOI
10.1142/S0217595905000613
ISSN
0217-5959 (print) 1793-7019 (online)
Rights
© 2005 World Scientific Publishing Co. & Operational Research Society of Singapore. All rights reserved.
Recommended Citation
Chakravarthy, Srinivas R. and Chukova, Stefanka, "A Finite Capacity Resequencing Model with Markovian Arrivals" (2005). Industrial & Manufacturing Engineering Publications. 30.
https://digitalcommons.kettering.edu/industrialmanuf_eng_facultypubs/30
