Flow Time Analysis of an Early Arrival System Using Discrete-Time Hypogeometrical Distribution

Author(s):  
Syed Asif Ali Shah ◽  
Wajihsa Shah ◽  
Safeeullah Soomro ◽  
Abdul Hameed Memon ◽  
Altaf Bouk ◽  
...  
1996 ◽  
Vol 33 (01) ◽  
pp. 239-255 ◽  
Author(s):  
M. L. Chaudhry ◽  
U. C. Gupta

This paper presents an analysis of the single-server discrete-time finite-buffer queue with general interarrival and geometric service time,GI/Geom/1/N. Using the supplementary variable technique, and considering the remaining interarrival time as a supplementary variable, two variations of this model, namely the late arrival system with delayed access (LAS-DA) and early arrival system (EAS), have been examined. For both cases, steady-state distributions for outside observers as well as at random and prearrival epochs have been obtained. The waiting time analysis has also been carried out. Results for theGeom/G/1/Nqueue with LAS-DA have been obtained from theGI/Geom/1/Nqueue with EAS. We also give various performance measures. An algorithm for computing state probabilities is given in an appendix.


1996 ◽  
Vol 33 (1) ◽  
pp. 239-255 ◽  
Author(s):  
M. L. Chaudhry ◽  
U. C. Gupta

This paper presents an analysis of the single-server discrete-time finite-buffer queue with general interarrival and geometric service time, GI/Geom/1/N. Using the supplementary variable technique, and considering the remaining interarrival time as a supplementary variable, two variations of this model, namely the late arrival system with delayed access (LAS-DA) and early arrival system (EAS), have been examined. For both cases, steady-state distributions for outside observers as well as at random and prearrival epochs have been obtained. The waiting time analysis has also been carried out. Results for the Geom/G/1/N queue with LAS-DA have been obtained from the GI/Geom/1/N queue with EAS. We also give various performance measures. An algorithm for computing state probabilities is given in an appendix.


2002 ◽  
Vol 39 (3) ◽  
pp. 503-516 ◽  
Author(s):  
Attahiru Sule Alfa ◽  
I. T. Castro

We consider, in discrete time, a single machine system that operates for a period of time represented by a general distribution. This machine is subject to failures during operations and the occurrence of these failures depends on how many times the machine has previously failed. Some failures are repairable and the repair times may or may not depend on the number of times the machine was previously repaired. Repair times also have a general distribution. The operating times of the machine depend on how many times it has failed and was subjected to repairs. Secondly, when the machine experiences a nonrepairable failure, it is replaced by another machine. The replacement machine may be new or a refurbished one. After the Nth failure, the machine is automatically replaced with a new one. We present a detailed analysis of special cases of this system, and we obtain the stationary distribution of the system and the optimal time for replacing the machine with a new one.


Author(s):  
Sebastian Rodriguez-Llamazares ◽  
Evelyn Lizette Sanchez-Ramos ◽  
Jessica Valencia-Rivero ◽  
Luis Joel Arroyo-Hernández ◽  
Edgar Felipe Castro-Arellano ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document