SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
MEM for arbitrary queueing networks with multiple general servers and repetitive-service blocking
13 references·13 citing·42 second hop
MEM for arbitrary queueing networks with multiple general servers and repetitive-service blocking (1989)MEM for arbitrary queueing networks with …Queueing networks with blocking (2003)Queueing networks with blocki…Survey of closed queueing networks with blocking (1990)Survey of closed queueing net…A Maximum Entropy Analysis of the G/G/1 Queue at Equilibrium (1988)A Maximum Entropy Analysis of…The generalized expansion method for open finite queueing networks (1987)The generalized expansion met…Modeling a Class of Flexible Manufacturing Systems with Reversible Routing (1987)Modeling a Class of Flexible …Approximate analysis of arbitrary configurations of open queueing networks with blocking (1987)Approximate analysis of arbit…Queueing models for a flexible machining station Part II: The method of Coxian phases (1985)Queueing models for a flexibl…Isolation Method in a Network of Queues (1980)Isolation Method in a Network…Analysis of Shared Finite Storage in a Computer Network Node Environment Under General Traffic Conditions (1980)Analysis of Shared Finite Sto…An Approximation Method for Open Restricted Queueing Networks (1980)An Approximation Method for O…Throughput Capacity of a Sequence of Queues with Blocking Due to Finite Waiting Room (1979)Throughput Capacity of a Sequ…Closed Exponential Networks of Queues with Saturation: The Jackson-Type Stationary Distribution and Its Asymptotic Analysis (1979)Closed Exponential Networks o…Queuing Networks with Multiple Closed Chains: Theory and Computational Algorithms (1975)Queuing Networks with Multipl…Performance analysis of open general queuing networks with blocking and feedback (2017)Performance analysis of open …Queue decomposition & finite closed queueing network models (2014)Queue decomposition & finite …Queueing Networks with Blocking: Analysis, Solution Algorithms and Properties (2011)Queueing Networks with Blocki…Properties and performance modelling of finite buffer M/G/1/K networks (2010)Properties and performance mo…Performance analysis of multi-server tandem queues with finite buffers and blocking (2005)Performance analysis of multi…Entropy maximisation and open queueing networks with priorities and blocking (2003)Entropy maximisation and open…An analytic model for capacity planning of prisons in the Netherlands (2000)An analytic model for capacit…Performance evaluation of open queueing networks with arbitrary configuration and finite buffers (1998)Performance evaluation of ope…MEM for arbitrary closed queueing networks with RS-blocking and multiple job classes (1998)MEM for arbitrary closed queu…Queueing system with queue length dependent service times and its application to cell discarding scheme in ATM networks (1996)Queueing system with queue le…ME-based approximations for general discrete-time queueing models (1994)ME-based approximations for g…Entropy maximised queueing networks with blocking and multiple job classes (1993)Entropy maximised queueing ne…A discrete-time queueing model of the shared buffer ATM switch with bursty arrivals (1993)A discrete-time queueing mode…Finite Queues in Series with Exponential or Erlang Service Times—A Numerical Approach (1967)Approximate Analysis of General Queuing Networks by Decomposition (1979)The Queueing Network Analyzer (1983)Buffer Space Allocation in Automated Assembly Lines (1988)Large production line optimization using simulated annealing (2000)The buffer allocation problem for general finite buffer queueing networks (2005)An Approximate Analytical Method for General Queueing Networks (1979)Approximating a Point Process by a Renewal Process, I: Two Basic Methods (1982)Poisson Arrivals See Time Averages (1982)The exponentialization approach to flexible manufacturing system models with general processing times (1986)Queueing Networks With Blocking. (1987)A bibliography of papers on queueing networks with finite capacity queues (1989)Closed Queuing Systems with Exponential Servers (1967)Open, Closed, and Mixed Networks of Queues with Different Classes of Customers (1975)Integral Representations and Asymptotic Expansions for Closed Markovian Queueing Networks: Normal Usage (1982)Product forms for queueing networks with state-dependent multiple job transitions (1991)On Decomposition Methods for Tandem Queueing Networks with Blocking (1993)Jobshop-Like Queueing Systems (2004)The behaviour of a single queue in a general queueing network (1976)Product Form and Local Balance in Queueing Networks (1977)Modelling the performance of flexible manufacturing systems (1985)Asymptotic behavior of the expansion method for open finite queueing networks (1988)An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking (1987)Analysis of multistation production systems with limited buffer capacity part 2: The decomposition method (1997)The case for modeling correlation in manufacturing systems (2001)Process optimization via neural network metamodeling (2002)Networks of Waiting Lines (1957)Computational algorithms for closed queueing networks with exponential servers (1973)Approximate analysis of exponential tandem queues with blocking (1982)A Proof for the Queuing Formula: L = λ W (1961)Fundamentals of Queueing Theory. (1977)Simulation Modeling and Analysis. (1983)Entropy maximisation and queueing network models (1994)A review on queueing network models with finite capacity queues for software architectures performance prediction (2003)Queueing networks with blocking (1984)Mean value analysis for blocking queueing networks (1988)Approximate Methods for Analyzing Queueing Network Models of Computing Systems (1978)Push and Pull Production Systems: Issues and Comparisons (1992)An Introduction to Numerical Transform Inversion and Its Application to Probability Models (2000)Buffer Management in a Packet Switch (1978)Sharing Memory Optimally (1983)Optimal buffer sharing (1995)
this work references cited by second hop

References

  • 1975Queuing Networks with Multiple Closed Chains: Theory and Computational Algorithms283 cited
  • 1980Analysis of Shared Finite Storage in a Computer Network Node Environment Under General Traffic Conditions218 cited
  • 1990Survey of closed queueing networks with blocking192 cited
  • 1979Closed Exponential Networks of Queues with Saturation: The Jackson-Type Stationary Distribution and Its Asymptotic Analysis132 cited
  • 1987The generalized expansion method for open finite queueing networks128 cited
  • 1980An Approximation Method for Open Restricted Queueing Networks128 cited
  • 1980Isolation Method in a Network of Queues95 cited
  • 1987Approximate analysis of arbitrary configurations of open queueing networks with blocking74 cited
  • 2003Queueing networks with blocking68 cited
  • 1985Queueing models for a flexible machining station Part II: The method of Coxian phases66 cited
  • 1979Throughput Capacity of a Sequence of Queues with Blocking Due to Finite Waiting Room65 cited
  • 1988A Maximum Entropy Analysis of the G/G/1 Queue at Equilibrium61 cited
  • 1987Modeling a Class of Flexible Manufacturing Systems with Reversible Routing59 cited

Cited by

  • 2003Entropy maximisation and open queueing networks with priorities and blocking55 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

  • 2005Performance analysis of multi-server tandem queues with finite buffers and blocking44 cited
  • 2011Queueing Networks with Blocking: Analysis, Solution Algorithms and Properties32 cited
  • 2010Properties and performance modelling of finite buffer M/G/1/K networks31 cited
  • 1993Entropy maximised queueing networks with blocking and multiple job classes28 cited
  • 1996Queueing system with queue length dependent service times and its application to cell discarding scheme in ATM networks26 cited
  • 2000An analytic model for capacity planning of prisons in the Netherlands24 cited
  • 1994ME-based approximations for general discrete-time queueing models24 cited
  • 1998Performance evaluation of open queueing networks with arbitrary configuration and finite buffers22 cited
  • 1998MEM for arbitrary closed queueing networks with RS-blocking and multiple job classes22 cited
  • 1993A discrete-time queueing model of the shared buffer ATM switch with bursty arrivals20 cited
  • 2014Queue decomposition & finite closed queueing network models19 cited
  • 2017Performance analysis of open general queuing networks with blocking and feedback18 cited