A recursive algorithm for generating the transition matrices of multistation multiserver exponential reliable queueing networks
From MaRDI portal
Publication:5953159
DOI10.1016/S0305-0548(00)00012-5zbMath1040.90007OpenAlexW2143515907WikidataQ127390948 ScholiaQ127390948MaRDI QIDQ5953159
M. I. Vidalis, H. T. Papadopoulos
Publication date: 2001
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(00)00012-5
Numerical solutionFinite queuesLarge sparse matricesMultistation multiserver queueing networksRecursive algorithmTransition matrices
Deterministic scheduling theory in operations research (90B35) Queues and service in operations research (90B22) Deterministic network models in operations research (90B10)
Related Items
Approximation of throughput in tandem queues with multiple servers and blocking, Exact analysis of a two-workstation one-buffer flow line with parallel unreliable machines
Cites Work
- Unnamed Item
- Unnamed Item
- Computational algorithms for networks of queues with rejection blocking
- Manufacturing flow line systems: A review of models and analytical results
- A review of open queueing network models of manufacturing systems
- The throughput rate of multistation unreliable production lines
- Decomposition of unreliable assembly/disassembly networks with limited buffer capacity and random processing times
- A survey of product form queueing networks with blocking and their equivalences
- Open finite queueing networks with \(M/M/C/K\) parallel servers
- Cyclic networks with general blocking and starvation
- Approximate mean value performance analysis of cyclic queueing networks with production blocking
- On the equivalence of three types of blocking in non-Markovian tandem queues
- Analysis of queueing networks with blocking using a new aggregation technique
- Arbitrary open queueing networks with server vacation periods and blocking
- Performance evaluation of open queueing networks with arbitrary configuration and finite buffers
- Throughput estimation in cyclic queueing networks with blocking
- MEM for arbitrary closed queueing networks with RS-blocking and multiple job classes
- Approximate analysis of networks of PH\(|\)PH\(| 1| K\) queues with customer losses: Test results
- An efficient two-phase approximation method for exponential tandem queueing systems with blocking
- On the optimal design of tandem queueing systems with finite buffers
- Approximate Analysis of Queues in Series with Phase-Type Service Times and Blocking
- The Reversibility Property of Production Lines
- Control policies for multi-product multi-stage manufacturing systems: An experimental approach
- An algorithm for sub-optimal routeing in series-parallel queueing networks
- Scheduling manufacturing systems with work-in-process inventory control: multiple-part-type systems
- A Simple And Quick Approximation Algorithm For Tandem, Split And Merge Queueing Networks With Blocking
- Safety Stock versus Safety Time in MRP Controlled Production Systems
- An Analytical Method for Performance Evaluation of Kanban Controlled Production Systems
- On Decomposition Methods for Tandem Queueing Networks with Blocking
- Finite Queues in Series with Exponential or Erlang Service Times—A Numerical Approach
