SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Stochastic Monotonicity of the Queue Lengths in Closed Queueing Networks
5 references·10 citing·43 second hop
Stochastic Monotonicity of the Queue Lengths in Closed Queueing Networks (1987)Stochastic Monotonicity of the Queue Leng…Analysis and Synthesis of Computer Systems (2010)Analysis and Synthesis of Com…Comparison Methods for Queues and Other Stochastic Models. (1986)Comparison Methods for Queues…Queues and Point Processes. (1985)Queues and Point Processes.A Concept of Monotonicity and Its Characterization for Closed Queueing Networks (1985)A Concept of Monotonicity and…Open and Closed Models for Networks of Queues (1984)Open and Closed Models for Ne…Erlang loss bounds for OT–ICU systems (2009)Erlang loss bounds for OT–ICU…Monotonicity in Generalized Semi-Markov Processes (1992)Monotonicity in Generalized S…Customer Service in Pull Production Systems (1992)Customer Service in Pull Prod…Approximate uniformization for continuous-time Markov chains with an application to performability analysis (1992)Approximate uniformization fo…Characteristics of optimal workload allocation for closed queueing networks (1991)Characteristics of optimal wo…Stochastic monotonicity in general queueing networks (1989)Stochastic monotonicity in ge…Simple bounds and monotonicity results for finite multi-server exponential tandem queues (1989)Simple bounds and monotonicit…Sample-path analysis of processes with imbedded point processes (1989)Sample-path analysis of proce…Monotonicity of the throughput in single server production and assembly networks with respect to the buffer sizes (1987)Monotonicity of the throughpu…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)Poisson Arrivals See Time Averages (1982)Assembly-like queues with finite capacity: Bounds, asymptotics and approximations (1986)Simple Bounds for Finite Single-Server Exponential Tandem Queues (1988)Approximate analysis of serial flow lines with multiple parallel-machine stations (2007)Exact analysis of a two-workstation one-buffer flow line with parallel unreliable machines (2008)Jobshop-Like Queueing Systems (1963)Open, Closed, and Mixed Networks of Queues with Different Classes of Customers (1975)The Queueing Network Analyzer (1983)Scheduling network of queues : heavy traffic analysis of multistation network with controllable inputs (1989)Push and Pull Production Systems: Issues and Comparisons (1992)The Potential of Servicizing as a Green Business Model (2016)Applied Probability and Queues (1987)Stochastic Modeling and the Theory of Queues (1989)Chapter 10 Queueing theory (1990)Unstable Asymptotics for Nonstationary Queues (1994)A sample path analysis of the M t /M t /c queue (1999)Introduction to Stochastic Processes (2014)Continuity of Generalized Semi-Markov Processes (1980)Stochastic convexity for multidimensional processes and its applications (1991)Properties of serial kanban systems (1992)Structured buffer-allocation problems (1996)Quantitative system performance: computer system analysis using queueing network models (1984)Simple bounds for queueing systems with breakdowns (1988)Toyota production system and Kanban system Materialization of just-in-time and respect-for-human system (1977)Toyota Production System (1993)Simulation study of CONWIP for a cold rolling plant (1998)Toyota production system: beyond large-scale production (1998)Total WIP and WIP mix for a CONWIP controlled job shop (2003)Using the when/where rules in dual resource constrained systems for a hybrid push-pull control (2008)The effect of increasing service rates in a closed queueing network (1986)Second-Order Properties of the Throughput of a Closed Queueing Network (1988)On the stability of open networks: A unified approach by stochastic dominance (1994)Steady-state $GI/G/n$ queue in the Halfin–Whitt regime (2013)Stochastic Models of Computer Communication Systems (1985)G-networks by triggered customer movement (1993)On the Efficiency-Fairness Trade-off (2012)Dynamic server allocation to parallel queues with randomly varying connectivity (1993)Stability, queue length, and delay of deterministic and stochastic queueing networks (1994)Optimal Investment Policies for a Firm With a Random Risk Process: Exponential Utility and Minimizing the Probability of Ruin (1995)Marked point processes as limits of Markovian arrival streams (1993)Logarithmic asymptotics for steady-state tail probabilities in a single-server queue (1994)OR FORUM—Little's Law as Viewed on Its 50th Anniversary (2011)
this work references cited by second hop

References

  • 1986Comparison Methods for Queues and Other Stochastic Models.938 cited
  • 2010Analysis and Synthesis of Computer Systems467 cited
  • 1985Queues and Point Processes.342 cited
  • 1984Open and Closed Models for Networks of Queues161 cited
  • 1985A Concept of Monotonicity and Its Characterization for Closed Queueing Networks55 cited

Cited by

  • 1992Customer Service in Pull Production Systems75 cited
  • 1992Monotonicity in Generalized Semi-Markov Processes50 cited
  • 1989Simple bounds and monotonicity results for finite multi-server exponential tandem queues48 cited
  • 1989Stochastic monotonicity in general queueing networks48 cited
  • 1989Sample-path analysis of processes with imbedded point processes46 cited
  • 2009Erlang loss bounds for OT–ICU systems40 cited
  • 1992Approximate uniformization for continuous-time Markov chains with an application to performability analysis26 cited
  • 1987Monotonicity of the throughput in single server production and assembly networks with respect to the buffer sizes26 cited
  • 1987A formal proof for the insensitivity of simple bounds for finite multi-server non-exponential tandem queues based on monotonicity results18 cited
  • 1991

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

Characteristics of optimal workload allocation for closed queueing networks
16 cited