SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Monotonicity of the Throughput of a Closed Queueing Network in the Number of Jobs
2 references·4 citing·21 second hop
Monotonicity of the Throughput of a Closed Queueing Network in the Number of Jobs (1989)Monotonicity of the Throughput of a Close…Some properties of the throughput function of closed networks of queues (1985)Some properties of the throug…A Concept of Monotonicity and Its Characterization for Closed Queueing Networks (1985)A Concept of Monotonicity and…The Case for a Unified Science of Operations (2020)The Case for a Unified Scienc…Error Bounds and Comparison Results: The Markov Reward Approach For Queueing Networks (2010)Error Bounds and Comparison R…Monotonicity and error bounds for networks of Erlang loss queues (2009)Monotonicity and error bounds…A formal proof for the insensitivity of simple bounds for finite multi-server non-exponential tandem queues based on monotonicity results (1987)A formal proof for the insens…Comparing counting processes and queues (1981)Comparison Methods for Queues and Other Stochastic Models (1984)Comparison Methods for Queues and Other Stochastic Models. (1986)Monotonicity of the throughput in single server production and assembly networks with respect to the buffer sizes (1987)The Arrangement of Servers in an Ordered-Entry System (1987)Monotonicity of the throughput of a closed exponential queueing network in the number of jobs (1989)Analysis and Synthesis of Computer Systems (2010)Open, Closed, and Mixed Networks of Queues with Different Classes of Customers (1975)Quantitative system performance: computer system analysis using queueing network models (1984)Stochastic Monotonicity of the Queue Lengths in Closed Queueing Networks (1987)Simple Bounds for Finite Single-Server Exponential Tandem Queues (1988)Simple bounds and monotonicity results for finite multi-server exponential tandem queues (1989)Loss Networks (1991)Elements of Queueing Theory: Palm Martingale Calculus and Stochastic Recurrences (2010)The Structure of Scientific Revolutions (1963)Information Distortion in a Supply Chain: The Bullwhip Effect (1997)Toyota production system: beyond large-scale production (1998)The nature and role of informal resilience practices in the performance of lean production systems (2022)Empirically grounding analytics ( EGA ) research in the Journal of Operations Management (2023)The Randomization Technique as a Modeling Tool and Solution Procedure for Transient Markov Processes (1984)An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking (1987)
this work references cited by second hop

References

  • 1985A Concept of Monotonicity and Its Characterization for Closed Queueing Networks55 cited
  • 1985Some properties of the throughput function of closed networks of queues40 cited

Cited by

  • 2020The Case for a Unified Science of Operations31 cited
  • 2010Error Bounds and Comparison Results: The Markov Reward Approach For Queueing Networks18 cited
  • 1987A formal proof for the insensitivity of simple bounds for finite multi-server non-exponential tandem queues based on monotonicity results18 cited
  • 2009Monotonicity and error bounds for networks of Erlang loss queues13 cited

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