Qeueing models for performance analysis: Selection of single station models
From MaRDI portal
Publication:1197662
DOI10.1016/0377-2217(92)90241-ZzbMath0761.90045MaRDI QIDQ1197662
Paul K. Makens, Mark C. Springer
Publication date: 16 January 1993
Published in: European Journal of Operational Research (Search for Journal in Brave)
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items
Modeling and optimization of buffers and servers in finite queueing networks ⋮ Buffer allocation in general single-server queueing networks ⋮ Optimal design and performance modelling of \(M/G/1/K\) queueing systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The generalized expansion method for open finite queueing networks
- Queueing models for a flexible machining station. I: The diffusion approximation
- Refining diffusion approximations for queues
- Approximate analysis of exponential queueing systems with blocking
- Approximate analysis of exponential tandem queues with blocking
- Approximations for departure processes and queues in series
- The optimal design of flexible manufacturing systems
- Approximation for the departure process of a queue in a network
- An Approximation Method for Tandem Queues with Blocking
- On Server Allocation in Multiple Center Manufacturing Systems
- Approximate Analysis of Queues in Series with Phase-Type Service Times and Blocking
- DIFFUSION APPROXIMATION FOR GI/G/1 QUEUEING SYSTEMS WITH FINITE CAPACITY : II-THE STATIONARY BEHAVIOUR
- An Approximation Method for Open Restricted Queueing Networks
- Measures of Lack of Fit for Response Surface Designs and Predictor Variable Transformations
- On Approximate Computer System Models
- Detection of Influential Observation in Linear Regression
- Approximate Analysis of General Queuing Networks by Decomposition
- DIFFUSION APPROXIMATION FOR GI/G/1 QUEUING SYSTEMS WITH FINITE CAPACITY : I-THE FIRST OVERFLOW TIME
- A computationally efficient approximation algorithm for feed-forward open queueing networks with blocking
- Approximate Models for Processor Utilization in Multiprogrammed Computer Systems
- Finite Queues in Series with Exponential or Erlang Service Times—A Numerical Approach
- Some Inequalities in Queuing