Analysis of a synchronization station for the performance evaluation of a kanban system with a general arrival process of demands (Q1266664): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A unified view of product-form approximation techniques for general closed queueing networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3899511 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Approximate Analytical Method for General Queueing Networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Analysis of a Kanban Discipline for Cell Coordination in Production Lines, II: Stochastic Demands / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3923308 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A general class of Markov processes with explicit matrix-geometric solutions / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 16:36, 28 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Analysis of a synchronization station for the performance evaluation of a kanban system with a general arrival process of demands |
scientific article |
Statements
Analysis of a synchronization station for the performance evaluation of a kanban system with a general arrival process of demands (English)
0 references
7 October 1998
0 references
queueing network
0 references
Markov chains
0 references
matrix-geometric solution
0 references
performance evaluation
0 references
kanban system
0 references
Poisson process
0 references
quasi-birth-and-death process
0 references
infinite number of states
0 references
0 references
0 references
