A decomposition approximation for assembly‐disassembly queueing networkswith finite buffer and blocking.
Nutthapol AsadathornXiuli ChaoPublished in: Ann. Oper. Res. (1999)
Keyphrases
- finite buffer
- interarrival and service times
- queueing systems
- steady state
- queue length
- loss probability
- queueing networks
- queueing model
- waiting times
- production system
- arrival rate
- single server queue
- state dependent
- service times
- heavy traffic
- approximation algorithms
- markov processes
- stationary distribution
- reinforcement learning
- single server
- long run
- lower bound
- computational complexity