A Moment-Iteration Method for Approximating the Waiting-Time Characteristics of the GI/G/1 Queue
From MaRDI portal
Publication:3415929
DOI10.1017/S0269964800001133zbMath1134.60414MaRDI QIDQ3415929
Publication date: 19 January 2007
Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (10)
Newsvendor characterizations for one-warehouse multi-retailer inventory systems with discrete demand under the balance assumption ⋮ Analyzing \(GI/E_ r/1\) queues ⋮ On the interaction between maintenance, spare part inventories and repair capacity for a \(k\)-out-of-\(N\) system with wear-out ⋮ Optimal sequencing using a scheduling heuristic ⋮ Lead time anticipation in supply chain operations planning ⋮ Control of a continuous production inventory system with production quantity restrictions ⋮ Product recovery in stochastic remanufacturing systems with multiple reuse options ⋮ Aggregate order release planning for time-varying demand ⋮ Materials coordination in stochastic multi-echelon systems ⋮ Discrete time queues and matrix-analytic methods. (With comments and rejoinder)
Cites Work
- Unnamed Item
- Unnamed Item
- Refining diffusion approximations for queues
- Simple approximations for the reorder point in periodic and continuous review (s,S) inventory systems with service level constraints
- Approximations for the conditional waiting times in the GI/G/c queue
- An algorithm for Ph/Ph/c queues
- Approximations for the GI/G/c queue
- Computing the Waiting Time Distribution for the G/G/1 Queue by Signal Processing Methods
- A Class of Approximations for the Waiting Time Distribution in aGI/G/1 Queueing System
This page was built for publication: A Moment-Iteration Method for Approximating the Waiting-Time Characteristics of the GI/G/1 Queue