scientific article
From MaRDI portal
Publication:3779558
DOI<23::AID-NAV3220350103>3.0.CO;2-B 10.1002/1520-6750(198802)35:1<23::AID-NAV3220350103>3.0.CO;2-BzbMath0638.60105MaRDI QIDQ3779558
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (24)
The distributional form of Little's law and the Fuhrmann-Cooper decomposition ⋮ Virtual waiting times in priority-\(M/G/1\) queues with vacations ⋮ Heavy-traffic asymptotics of a priority polling system with threshold service policy ⋮ Priority queues with semi-exhaustive service ⋮ A two-queue polling model with two priority levels in the first queue ⋮ Improving efficiency of service systems by performing a part of the service without the customer's presence ⋮ Distributions and first moments of the busy and idle periods in controllableM/G/1 Queueing Models with Simple and Dyadic Policies ⋮ Unnamed Item ⋮ Priority queues with batch Poisson arrivals ⋮ Reducing Delay in Retrial Queues by Simultaneously Differentiating Service and Retrial Rates ⋮ On the three-queue priority polling system with threshold service policy ⋮ The \(M/G/1/K\) blocking formula and its generalizations to state-dependent vacation systems and priority systems ⋮ A note on conservation laws for a multi-class service queueing system with setup times ⋮ Mixed gated/exhaustive service in a polling model with priorities ⋮ An Invariance in the Priority Queue with Generalized Server Vacations and Structured Batch Arrivals ⋮ Heavy-traffic limits for polling models with exhaustive service and non-FCFS service order policies ⋮ A queueing system with decomposed service and inventoried preliminary services ⋮ A finite capacity multi-queueing system with priorities and with repeated server vacations ⋮ Analysis of preemptive loss priority queues with preemption distance ⋮ Priority queues with semiexhaustive service and class-dependent setup times. ⋮ Delay analysis of discrete-time priority queue with structured inputs ⋮ A tandem Jackson network with feedback to the first node ⋮ Expected waiting times in polling systems under priority disciplines ⋮ The \(M^ X/G/1\) queue with single and multiple vacations under the LIFO service regime
Cites Work
This page was built for publication:
