Conditional inter-departure times from the M/G/s queue

@article{Veeger2011ConditionalIT,
  title={Conditional inter-departure times from the M/G/s queue},
  author={Casper Veeger and Yoav Kerner and L. F. Pascal Etman and Ivo Adan},
  journal={Queueing Systems},
  year={2011},
  volume={68},
  pages={353-360}
}
We study the mean and the distribution of the time elapsing between two consecutive departures from the stationary M/G/s queue given the number of customers left behind by the first departure is equal to n. It is conjectured that if the failure rate of the service time distribution is increasing (decreasing), then (i) the limit of the mean conditional inter-departure time as n tends to infinity is less (greater) than the mean service time divided by the number of servers s, and (ii) the… 
Simplification of DES models of M/M/1 tandem queues by approximating WIP-dependent inter-departure times
TLDR
Two algorithms to analytically approximate work in process (WIP)-dependent inter-departure times for tandem queues composed of a series of M/M/1 systems are presented, rendering this approach applicable in many applications.
Aggregate simulation modeling of an MRI department using effective process times
TLDR
This work studies three different aggregate models for use in the MRI setting and uses a detailed simulation model as virtual MRI department to evaluate the prediction accuracy of the candidate aggregate models.

References

SHOWING 1-10 OF 10 REFERENCES
Some invariance properties of monotone failure rate in the M/G/1 queue
We show that in the stationary M=G=1 queue, if the service time distribution is with increasing (decreasing) failure rate (IFR(DFR)), then (a) The distribution of the number of customers in the
Conditional Ages and Residual Service Times in the M/G/1 Queue
TLDR
The M/G/1 queue is studied, and results on the age, residual, and length of service, conditional on the number of customers present in the system are collected.
The Queueing Network Analyzer
  • W. Whitt
  • Computer Science
    The Bell System Technical Journal
  • 1983
TLDR
This paper describes the Queueing Network Analyzer (QNA), a software package developed at Bell Laboratories to calculate approximate congestion measures for a network of queues and uses two parameters to characterize the arrival processes and service times.
Approximate Analysis of General Queuing Networks by Decomposition
  • P. Kuehn
  • Mathematics
    IEEE Trans. Commun.
  • 1979
TLDR
An approximate method for the analysis of general queuing networks is proposed, based on the method of decomposition where the total network is broken up into subsystems; e.g., queuing stations of the type GI/G/1 or subnets.
Approximations for departure processes and queues in series
Methods are developed for approximately characterizing the departure process from a single-server queue and calculating approximate congestion measures for several single-server queues in series.
Aggregate modeling of multi-processing workstations
In this paper an aggregate model for manufacturing systems consisting of o w lines with nite buers and parallel servers is proposed. The proposed model is a multi-server station with process times
Predicting Cycle Time Distributions for Integrated Processing Workstations: An Aggregate Modeling Approach
TLDR
The aggregate model is a single server with a work-in-process dependent aggregate process time distribution and overtaking distribution that can accurately predict the cycle time distribution of integrated processing workstations in semiconductor manufacturing.
Matrix-Geometric Solutions in Stochastic Models
Cycle time distributions of semiconductor workstations using aggregate modeling
TLDR
This paper presents a simulation case that demonstrates the accuracy of the aggregate model to predict cycle time distributions and applies the proposed method to a case from semiconductor industry, and illustrates how the method performs using arrival and departure data obtained from the manufacturing execution system.
A class of Markov processes on a semi-infinite strip
In this paper we determine the equilibrium distribution for a general class of Markov processes on a semi-infinite strip. We expose a method to express the equilibrium probabilities of the Markov