An approximation for computing the throughput of closed assembly-type queueing networks (Q1806887): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5560061 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Estimating the throughput of a cyclic assembly system / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Estimating the throughput of an exponential CONWIP assembly system / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3262596 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3241404 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Stochastic orders / rank | |||
Normal rank |
Revision as of 10:03, 29 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An approximation for computing the throughput of closed assembly-type queueing networks |
scientific article |
Statements
An approximation for computing the throughput of closed assembly-type queueing networks (English)
0 references
8 November 1999
0 references
assembly-type
0 references
queueing network
0 references
Markovian analysis
0 references