Light traffic heuristic for an \(M/G/1\) queue with limited inventory (Q689259)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Light traffic heuristic for an \(M/G/1\) queue with limited inventory |
scientific article; zbMATH DE number 445046
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Light traffic heuristic for an \(M/G/1\) queue with limited inventory |
scientific article; zbMATH DE number 445046 |
Statements
Light traffic heuristic for an \(M/G/1\) queue with limited inventory (English)
0 references
20 December 1993
0 references
Motivated by solving a stylized location problem, the authors develop a light traffic heuristic for an \(M/G/1\) queue with limited inventory that gives rise to a closed form expression for average delay in terms of basic system parameters. Simulation experiments illustrate the heuristic. The inventory level drops by one unit after each service completion an whenever it drops to a pre-specified level \(u\), an order is placed with replenishment time \(\sim\exp(\gamma)\). Upon replenishment the inventory is restocked to a pre-specified level \(s\) and any arrivals when there is no inventory are placed in queue. Applications to inventory management problems are discussed.
0 references
simulation
0 references
location
0 references
light traffic
0 references
\(M/G/1\) queue
0 references
limited inventory
0 references
average delay
0 references
heuristic
0 references