scientific article; zbMATH DE number 3943022

MaRDI QIDQ3713600zbMATH OpenFDO

Authors A. Szep

Publication date 1986

zbMATH Keywords

closed queueing systemsEfficient algorithmsnon-preemptive priority queuespreemptive resume

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Queues and service in operations research (90B22)

Recommendations

• Explicit Solutions of M/G/C/ /N-type Queueing Loops with Generalizations
• A Fixed-Point Algorithm for Closed Queueing Networks
• An Iterative Algorithm for a Multiple Finite-source Queueing Model with Dynamic Priority Scheduling
• Iterative solution of the \(M^{[x]}/C_ 2/S/N\) queues
• A numerical approach to cyclic-service queueing models

Cited in

(1)

• Explicit Solutions of M/G/C/ /N-type Queueing Loops with Generalizations

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3713600)