SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Allocation of interdependent resources for maximal throughput
4 references·5 citing·33 second hop
Allocation of interdependent resources for maximal throughput (2000)Allocation of interdependent resources fo…Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks (1992)Stability properties of const…Annals of operations research (1989)Annals of operations researchStochastic Models of Computer Communication Systems (1985)Stochastic Models of Computer…The stability of a queue with non-independent inter-arrival and service times (1962)The stability of a queue with…Processing Networks (2020)Processing NetworksRobustness of efficient server assignment policies to service time distributions in finite‐buffered lines (2010)Robustness of efficient serve…A Push–Pull Network with Infinite Supply of Work (2009)A Push–Pull Network with Infi…DYNAMIC ASSIGNMENT OF DEDICATED AND FLEXIBLE SERVERS IN TANDEM LINES (2007)DYNAMIC ASSIGNMENT OF DEDICAT…Compensating for Failures with Flexible Servers (2007)Compensating for Failures wit…Principles on the Benefits of Manufacturing Process Flexibility (1995)Agile workforce evaluation: a framework for cross-training and coordination (2004)Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule (2004)Applied Probability and Queues (1987)Achieving 100% throughput in an input-queued switch (1999)Achieving 100% throughput in an input-queued switch (2002)Piecewise-Deterministic Markov Processes: A General Class of Non-Diffusion Stochastic Models (1984)On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models (1995)OPTIMAL CONTROL OF A TWO-SERVER QUEUEING SYSTEM WITH FAILURES (2014)Process Flexibility for Multiperiod Production Systems (2019)Assigning spontaneous volunteers to relief efforts under uncertainty in task demand and volunteer availability (2020)Fundamentals of Queueing Networks (2001)Control Techniques for Complex Networks (2007)Positive Harris Recurrence and Diffusion Scale Analysis of a Push Pull Queueing Network (2008)Non-existence of stabilizing policies for the critical push–pull network and generalizations (2013)Stability of multi-class queueing networks with infinite virtual queues (2013)Hitting-time and occupation-time bounds implied by drift analysis with applications (1982)Blocking probabilities in large circuit-switched networks (1986)Optimal Control and Trunk Reservation in Loss Networks (1990)An algorithm to compute blocking probabilities in multi-rate multi-class multi-resource loss models (1995)Analysis and Synthesis of Computer Systems (2010)Economies-of-Scale in Many-Server Queueing Systems: Tutorial and Partial Review of the QED Halfin--Whitt Heavy-Traffic Regime (2019)Open, Closed, and Mixed Networks of Queues with Different Classes of Customers (1975)Introduction to Matrix Analytic Methods in Stochastic Modeling (1999)Stability of Redundancy Systems with Processor Sharing (2020)Applications of fluid models in service operations management (2022)The role of multiplier bounds in efficiency analysis with application to Kansas farming (1990)Recent developments in modeling preferences: Uncertainty and ambiguity (1992)Blockchain technology for enhancing swift-trust, collaboration and resilience within a humanitarian supply chain setting (2020)On Queues in Heavy Traffic (1962)On the stability of interacting queues in a multiple-access system (1988)Stability, queue length, and delay of deterministic and stochastic queueing networks (1994)Customer Acquisition and Retention: A Fluid Approach for Staffing (2021)
this work references cited by second hop

References

  • 1992Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks2,838 cited
  • 1989Annals of operations research1,324 cited
  • 1962The stability of a queue with non-independent inter-arrival and service times1,045 cited
  • 1985Stochastic Models of Computer Communication Systems355 cited

Cited by

  • 2009A Push–Pull Network with Infinite Supply of Work52 cited
  • 2007Compensating for Failures with Flexible Servers35 cited
  • 2007DYNAMIC ASSIGNMENT OF DEDICATED AND FLEXIBLE SERVERS IN TANDEM LINES29 cited
  • 2020Processing Networks22 cited
  • 2010Robustness of efficient server assignment policies to service time distributions in finite‐buffered lines18 cited

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