Two Homogeneous Servers Limited Capacity Markovian Queuing System Subjected to Varying Catastrophic Intensity

نویسندگان

  • N. K. Jain
  • Gulab Singh Bura
چکیده

In the present paper, we analyze the effect of varying catastrophic intensity on a limited capacity Markovian queueing system with two identical servers. The time dependent probabilities for the number in the system are obtained. The steady state probabilities and various measures of performance are also provided. Further some important particulars cases are also derived and discussed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Two Heterogeneous Servers Limited Capacity Markovian Queueing System Subjected to Varying Catastrophic

In this paper we consider a limited capacity Markovian queueing system with two heterogeneous servers subjected to varying catastrophic intensity. The transient solution of the model has been obtained and various measures of performance have been computed numerically with the help of simulation technique. The steady state solution of the system has also been provided.

متن کامل

Two Homogeneous Servers Limited Capacity

In the present paper, we analyze the effect of varying catastrophic intensity on a limited capacity Markovian queueing system with two identical servers. The time dependent probabilities for the number in the system are obtained. The steady state probabilities and various measures of performance are also provided. Further some important particulars cases are also derived and discussed.

متن کامل

Analyses of a Markovian queue with two heterogeneous servers and working vacation

This paper analyzes an M/M/2 queueing system with two heterogeneous servers. Both servers goes on vacation when there is no customers waiting for service after this server 1 is always available but the other goes on vacation whenever server 2 is idle. The vacationing server however, returns to serve at a low rate as an arrival finds the other server busy. The system is analyzed in the steady st...

متن کامل

Maximal covering location-allocation problem with M/M/k queuing system and side constraints

  We consider the maximal covering location-allocation problem with multiple servers. The objective is to maximize the population covered, subject to constraints on the number of service centers, total number of servers in all centers, and the average waiting time at each center. Each center operates as an M/M/k queuing system with variable number of servers. The total costs of establishing cen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016