STABILITY OF A SIMPLE RE-ENTRANT LINE WITH INFINITE SUPPLY OF WORK : THE CASE OF EXPONENTIAL PROCESSING TIMES(<Special Issue>Network Design, Control and Optimization)
From MaRDI portal
Publication:4671024
Cited in
(7)- On the strong approximation for a simple reentrant line in light traffic under first-buffer first-served service discipline
- Fluid model criterion for instability of re-entrant line with infinite supply of work
- Stability of generalized Jackson networks with infinite supply of work
- Stability of multi-class queueing networks with infinite virtual queues
- Analysis of a simple Markovian re-entrant line with infinite supply of work under the LBFS policy
- Modeling, simulation and performance analysis of a flexible production system
- Jackson networks with unlimited supply of work
This page was built for publication: STABILITY OF A SIMPLE RE-ENTRANT LINE WITH INFINITE SUPPLY OF WORK : THE CASE OF EXPONENTIAL PROCESSING TIMES(<Special Issue>Network Design, Control and Optimization)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4671024)