The transient solution of M/M/1 queues under (M,N)-policy. A combinatorial approach (Q1209635): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3331506 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The transient solution of M/M/1 queues under (M,N)-policy. A combinatorial approach / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lattice Paths with Diagonal Steps / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a Generalization of One Dimensional Random Walk with a Partially Reflecting Barrier / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3326556 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5528220 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3903764 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3358023 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lattice path approach to transient solution of \(M/M/1\) with (\(0,k\)) control policy / rank | |||
Normal rank |
Latest revision as of 15:40, 17 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The transient solution of M/M/1 queues under (M,N)-policy. A combinatorial approach |
scientific article |
Statements
The transient solution of M/M/1 queues under (M,N)-policy. A combinatorial approach (English)
0 references
16 May 1993
0 references
M/M/1 queues
0 references
(M,N)-policy
0 references
probability distributions
0 references
queueing theory
0 references
transient solution
0 references
lattice paths
0 references