فهرس المقالات Arbitrary service time

• حرية الوصول المقاله
  • صفحة الملخص
  • نص كامل
  
  1 - Analysis of unreliable bulk queue with statedependent arrivals
  Charan Jeet Singh Madhu Jain Binay Kumar
  In this paper, we investigate a single-server Poisson input queueing model, wherein arrivals of units are in bulk. The arrival rate of the units is state dependent, and service time is arbitrary distributed. It is also assumed that the system is subject to breakdown, أکثر

  In this paper, we investigate a single-server Poisson input queueing model, wherein arrivals of units are in bulk. The arrival rate of the units is state dependent, and service time is arbitrary distributed. It is also assumed that the system is subject to breakdown, and the failed server immediately joins the repair facility which takes constant duration to repair the server. By using supplementary variable technique, we obtain the probability generating function of the number of units in the system which is further used to establish some performance indices such as the mean number of units in the system, mean waiting time, etc. Special cases are also discussed. In order to obtain approximate values of system state probabilities, the principle of maximum entropy is employed. Numerical results are also presented to validate the analytical formulae. تفاصيل المقالة
• حرية الوصول المقاله
  • صفحة الملخص
  • نص كامل
  
  2 - Analysis of M/G/ 1 queueing model with state dependent arrival and vacation
  Charan Jeet Singh Madhu Jain Binay Kumar
  This investigation deals with single server queueing system wherein the arrival of the units follow Poisson process with varying arrival rates in different states and the service time of the units is arbitrary (general) distributed. The server may take a vacation of a f أکثر

  This investigation deals with single server queueing system wherein the arrival of the units follow Poisson process with varying arrival rates in different states and the service time of the units is arbitrary (general) distributed. The server may take a vacation of a fixed duration or may continue to be available in the system for next service. Using the probability argument, we construct the set of steady state equations by introducing the supplementary variable corresponding to elapsed service time. Then, we obtain the probability generating function of the units present in the system. Various performance indices, such as expected number of units in the queue and in the system, average waiting time, etc., are obtained explicitly. Some special cases are also deduced by setting the appropriate parameter values. The numerical illustrations are provided to carry out the sensitivity analysis in order to explore the effect of different parameters on the system performance measures. تفاصيل المقالة