Higher order approximations for the single server queue with splitting, merging and feedback
From MaRDI portal
Publication:1577991
DOI10.1016/S0377-2217(99)00174-5zbMath0969.90029MaRDI QIDQ1577991
Publication date: 19 September 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Approximation methods and heuristics in mathematical programming (90C59) Queues and service in operations research (90B22) Deterministic network models in operations research (90B10) Markov and semi-Markov decision processes (90C40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The MacLaurin expansion for a \(G/G/1\) queue with Markov-modulated arrivals and services
- An investigation of phase-distribution moment-matching algorithms for use in queueing models
- A graphical investigation of error bounds for moment-based queueing approximations
- The QNET method for two-moment analysis of open queueing networks
- On queueing network models of flexible manufacturing systems
- An interpolation approximation for the \(GI/G/1\) queue based on multipoint Padé approximation
- Higher order approximations for tandem queueing networks
- Approximating a Point Process by a Renewal Process, II: Superposition Arrival Processes to Queues
- Approximating a Point Process by a Renewal Process, I: Two Basic Methods
- The MacLaurin series for the GI/G/1 queue
- Meda: mixed erlang distributions as phase-type representations of empirical distribution functions.
- Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
- Approximate Analysis of General Queuing Networks by Decomposition
- Selecting Parameters of Phase Distributions: Combining Nonlinear Programming, Heuristics, and Erlang Distributions
- Approximating Nonrenewal Processes by Markov Chains: Use of Super-Erlang (SE) Chains
- Analysis of the ΣPhi/Ph/1 Queue
- The Departure Process of the GI/G/1 Queue and Its MacLaurin Series
- Matching moments to phase distributions: Mixtures of erlang distributions of common order
- Closed Queuing Systems with Exponential Servers
This page was built for publication: Higher order approximations for the single server queue with splitting, merging and feedback