The following pages link to (Q4843184):
Displaying 29 items.
- Queue decomposition \& finite closed queueing network models (Q337276) (← links)
- Approximate analysis of single-server tandem queues with finite buffers (Q383145) (← links)
- Loss tandem networks with blocking -- a semi-Markov approach (Q554346) (← links)
- Error bounds on practical approximation for two tandem queue with blocking and non-preemptive priority (Q636567) (← links)
- A tandem network with a sharing buffer (Q646215) (← links)
- An analytic finite capacity queueing network model capturing the propagation of congestion and blocking (Q1041947) (← links)
- Histogram based bounds and approximations for production lines (Q1042029) (← links)
- Approximation of throughput in tandem queues with multiple servers and blocking (Q1634584) (← links)
- A method of approximate analysis of an open exponential queuing network with losses due to finite shared buffers in multi-queue nodes (Q1698901) (← links)
- Explicit expressions for moments of waiting times in Poisson driven deterministic two-node tandem queues with blocking (Q1785639) (← links)
- A tractable analytical model for large-scale congested protein synthesis networks (Q1926678) (← links)
- Multi-objective routing within large scale facilities using open finite queueing networks (Q1969895) (← links)
- Time-varying tandem queues with blocking: modeling, analysis, and operational insights via fluid models with reflection (Q1992143) (← links)
- Time-varying many-server finite-queues in tandem: comparing blocking mechanisms via fluid models (Q2294222) (← links)
- Probability masses Fitting in the analysis of manufacturing flow lines (Q2430642) (← links)
- Response time in a tandem queue with blocking, Markovian arrivals and phase-type services (Q2488232) (← links)
- Throughput of flow lines with unreliable parallel-machine workstations and blocking (Q2628191) (← links)
- A comparative analysis of the successive lumping and the lattice path counting algorithms (Q2804417) (← links)
- Semi-Markov-Based Approach for the Analysis of Open Tandem Networks with Blocking and Truncation (Q3392522) (← links)
- EVALUATING PERFORMANCE OF FLOW LINE SYSTEMS WITH BLOCKING UNDER FUZZY ENVIRONMENTS (Q3393514) (← links)
- MODELING TRAFFIC FLOWS WITH QUEUEING MODELS: A REVIEW (Q3503065) (← links)
- A. B. Clarke's Tandem Queue Revisited—Sojourn Times (Q3548432) (← links)
- PERFORMANCE MEASURES FOR THE TWO-NODE QUEUE WITH FINITE BUFFERS (Q5070869) (← links)
- Capacity Analysis of Sequential Zone Picking Systems (Q5130489) (← links)
- An Approximation Method for Blocking Probabilities in M/D/1/K<sub>1</sub>→ ⋅/D/1/K<sub>2</sub>Queues (Q5265458) (← links)
- QRF (Q5270668) (← links)
- A perishable inventory system with modified \((S-1,S)\) policy and arbitrary processing times. (Q5932341) (← links)
- A recursive algorithm for generating the transition matrices of multistation multiserver exponential reliable queueing networks (Q5953159) (← links)
- Analysis of an epoch commit protocol for distributed processing systems (Q6546461) (← links)
