Pages that link to "Item:Q3829331"

The following pages link to Numerical Solutions of the Waiting Time Distribution and Idle Time Distribution of the Arithmetic GI/G/1 Queue (Q3829331):

Displaying 18 items.

• 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 (Q421081) (← links)
• A general model for batch building processes under the timeout and capacity rules (Q499296) (← links)
• Fluctuation identities with continuous monitoring and their application to the pricing of barrier options (Q724078) (← links)
• Value of capacity pooling in supply chains with heterogeneous customers (Q856216) (← links)
• An analytical method for the calculation of the waiting time distribution of a discrete time G/G/1-queueing system with batch arrivals (Q1018260) (← links)
• Numerical solution for the departure process from the GI/G/1 queue (Q1099514) (← links)
• Exact and approximate numerical solutions of steady-state distributions arising in the queue \(GI/G/1\) (Q1183691) (← links)
• An analytical solution for the discrete time single server system with semi-Markovian arrivals (Q1339091) (← links)
• Non-skip-free M/G/1-type Markov chains and Laurent matrix power series (Q1434422) (← links)
• New approach for finding basic performance measures of single server queue (Q1667387) (← links)
• Discrete time queues and matrix-analytic methods. (With comments and rejoinder) (Q1871416) (← links)
• Performance analysis of the \(DAR(1)/D/c\) priority queue under partial buffer sharing policy (Q1886000) (← links)
• Point and interval estimation of decomposition error in discrete-time open tandem queues (Q2084028) (← links)
• Age process, workload process, sojourn times, and waiting times in a discrete time SM[K]/PH[K]/1/FCFS queue (Q2572898) (← links)
• Workload Process, Waiting Times, and Sojourn Times in a Discrete Time<i>MMAP</i>[<i>K</i>]/<i>SM</i>[<i>K</i>]/1/FCFS Queue (Q3157860) (← links)
• Some Results for the Actual Waiting Time in Batch Arrival Queueing Systems (Q3161155) (← links)
• Polynomial Factorization for Servers with Semi-Markovian Workload: Performance and Numerical Aspects of a Verified Solution Technique (Q5462811) (← links)
• A numerical method to determine the waiting time and the idle time distributions of a <i>GI/G/</i>1 queue when inter-arrival times and/or service times have geometric tails (Q5884366) (← links)