SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Further results for dynamic scheduling of multiclassG/G/1 queues
8 references·2 citing·42 second hop
Further results for dynamic scheduling of multiclassG/G/1 queues (1989)Further results for dynamic scheduling of…Convex ordering of sojourn times in single-server queues: extremal properties of FIFO and LIFO service disciplines (1987)Convex ordering of sojourn ti…The c μ rule revisited (1985)The c μ rule revisitedExtensions of the multiarmed bandit problem: The discounted case (1985)Extensions of the multiarmed …Arm-Acquiring Bandits (1981)Arm-Acquiring BanditsBandit Processes and Dynamic Allocation Indices (1979)Bandit Processes and Dynamic …Time-Sharing Service Systems. I (1975)Time-Sharing Service Systems.…Dynamic Scheduling of a Multiclass Queue: Discount Optimality (1975)Dynamic Scheduling of a Multi…Work-conserving priorities (1970)Work-conserving prioritiesOptimal scheduling policies in time sharing service systems (1995)Optimal scheduling policies i…Optimal scheduling in a machine with stochastic varying processing rate (1994)Optimal scheduling in a machi…Multi-Armed Bandits and the Gittins Index (1980)The Specification and Estimation of Dynamic Stochastic Discrete Choice Models: A Survey (1989)Multi-Armed Bandit Problems (2007)Multi-armed Bandit Models for the Optimal Design of Clinical Trials: Benefits and Challenges (2015)Comparison Methods for Queues and Other Stochastic Models (1984)Comparison Methods for Queues and Other Stochastic Models. (1986)Stochastic Modeling and the Theory of Queues (1989)Estimation of the most likely equilibrium traffic queueing pattern in a capacityconstrained network (1999)A dimension-reduced method of sensitivity analysis for stochastic user equilibrium assignment model (2009)On ergodicity conditions in a polling model with Markov modulated input and state-dependent routing (2014)Principles of Operations Research. (1970)Characterization and Computation of Optimal Policies for Operating an M/G/1 Queuing System with Removable Server (1971)Dynamic Decisions and Work Load in Multitask Supervisory Control (1980)Due-Date Setting and Priority Sequencing in a Multiclass M/G/1 Queue (1991)Four proofs of Gittins’ multiarmed bandit theorem (2014)Analysis and synthesis of computer systems (1982)Optimal policy for multi-class scheduling in a single server queue (2009)Analysis and Synthesis of Computer Systems (2010)The effect of queue discipline on waiting time variance (1962)The sojourn time in the GI/M/1 queue by processor sharing (1984)Queueing performance with impatient customers (1991)Extremal properties of the FIFO discipline in queueing networks (1992)Sojourn times in polling systems with various service disciplines (2009)Priority Assignment in Waiting Line Problems (1954)A Proof for the Queuing Formula: L = λ W (1961)A Waiting Line with Interrupted Service, Including Priorities (1962)Multiple feedback at a single-server station (1977)On extremal service disciplines in single-stage queueing systems (1990)One-Dependent Regenerative Processes and Queues in Continuous Time (1990)Some aspects of the sequential design of experiments (1952)Applied Statistical Decision Theory (1962)Applied Statistical Decision Theory. (1962)Restless bandits: activity allocation in a changing world (1988)Legislative leviathan: party government in the House (1993)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Closed Network (1990)Restless bandits, partial conservation laws and indexability (2001)Bandit Processes (1983)Mortal Multi-Armed Bandits (2008)On the Optimal Control of Two Queues with Server Setup Times and Its Analysis (1987)Optimal Dynamic Scheduling Policy for a Make-To-Stock Production System (1997)The cμ/θ Rule for Many-Server Queues with Abandonment (2010)
this work references cited by second hop

References

  • 1979Bandit Processes and Dynamic Allocation Indices1,488 cited
  • 1975Time-Sharing Service Systems. I285 cited
  • 1985Extensions of the multiarmed bandit problem: The discounted case278 cited
  • 1985The c μ rule revisited236 cited
  • 1975Dynamic Scheduling of a Multiclass Queue: Discount Optimality148 cited
  • 1981Arm-Acquiring Bandits141 cited
  • 1970Work-conserving priorities78 cited
  • 1987Convex ordering of sojourn times in single-server queues: extremal properties of FIFO and LIFO service disciplines40 cited

Cited by

  • 1995Optimal scheduling policies in time sharing service systems24 cited
  • 1994Optimal scheduling in a machine with stochastic varying processing rate21 cited

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