An approximation for computing the throughput of closed assembly-type queueing networks (Q1806887): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
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 | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0377-2217(97)00390-1 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2066197419 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 10:21, 30 July 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