Numerical Solutions of the Waiting Time Distribution and Idle Time Distribution of the Arithmetic GI/G/1 Queue
From MaRDI portal
Publication:3829331
DOI10.1287/OPRE.37.1.141zbMATH Open0674.90037OpenAlexW2167006582MaRDI QIDQ3829331FDOQ3829331
Joti L. Jain, Winfried K. Grassmann
Publication date: 1989
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.37.1.141
Recommendations
- A numerical method to determine the waiting time and the idle time distributions of a GI/G/1 queue when inter-arrival times and/or service times have geometric tails
- On the stationary waiting-time distribution in the GI/G/1 queue, I: Transform methods and almost-phase-type distributions
- Numerical solution for the departure process from the GI/G/1 queue
- Exact and approximate numerical solutions of steady-state distributions arising in the queue \(GI/G/1\)
- An approximation method for the analysis of GI/G/1 queues
Reliability, availability, maintenance, inspection in operations research (90B25) Queueing theory (aspects of probability theory) (60K25)
Cited In (20)
- Exact and approximate numerical solutions of steady-state distributions arising in the queue \(GI/G/1\)
- Workload Process, Waiting Times, and Sojourn Times in a Discrete TimeMMAP[K]/SM[K]/1/FCFS Queue
- An analytical method for the calculation of the number of units at the arrival instant in a discrete time G/G/1-queueing system with batch arrivals
- Value of capacity pooling in supply chains with heterogeneous customers
- Performance analysis of the \(DAR(1)/D/c\) priority queue under partial buffer sharing policy
- Discrete time queues and matrix-analytic methods. (With comments and rejoinder)
- An analytical method for the calculation of the waiting time distribution of a discrete time G/G/1-queueing system with batch arrivals
- Fluctuation identities with continuous monitoring and their application to the pricing of barrier options
- A numerical method to determine the waiting time and the idle time distributions of a GI/G/1 queue when inter-arrival times and/or service times have geometric tails
- Age process, workload process, sojourn times, and waiting times in a discrete time SM[K]/PH[K]/1/FCFS queue
- Numerical solution for the departure process from the GI/G/1 queue
- Non-skip-free M/G/1-type Markov chains and Laurent matrix power series
- An analytical solution for the discrete time single server system with semi-Markovian arrivals
- Polynomial Factorization for Servers with Semi-Markovian Workload: Performance and Numerical Aspects of a Verified Solution Technique
- Title not available (Why is that?)
- A general model for batch building processes under the timeout and capacity rules
- Characterizing the idle-period distribution of GI/G/1 queues
- Point and interval estimation of decomposition error in discrete-time open tandem queues
- Some Results for the Actual Waiting Time in Batch Arrival Queueing Systems
- New approach for finding basic performance measures of single server queue
This page was built for publication: Numerical Solutions of the Waiting Time Distribution and Idle Time Distribution of the Arithmetic GI/G/1 Queue
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3829331)