SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Optimal allocation of a server between two queues with due times
9 references·0 citing·38 second hop
Optimal allocation of a server between two queues with due times (1991)Optimal allocation of a server between tw…Optimal scheduling with strict deadlines (1989)Optimal scheduling with stric…Optimal priority assignment: a time sharing approach (1989)Optimal priority assignment: …Optimal scheduling of interactive and noninteractive traffic in telecommunication systems (1988)Optimal scheduling of interac…Optimal priority assignment with hard constraint (1986)Optimal priority assignment w…The c μ rule revisited (1985)The c μ rule revisitedK competing queues with geometric service requirements and linear costs: The μc-rule is always optimal (1985)K competing queues with geome…Extensions of the multiarmed bandit problem: The discounted case (1985)Extensions of the multiarmed …Optimal control of two interacting service stations (1984)Optimal control of two intera…Dynamic Scheduling of a Multiclass Queue: Discount Optimality (1975)Dynamic Scheduling of a Multi…Time-Sharing Service Systems. I (1975)Bandit Processes and Dynamic Allocation Indices (1979)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)Constrained Markov Games: Nash Equilibria (2000)Suboptimality Bounds in Stochastic Control: A Queueing Example (2006)Analysis and Synthesis of Computer Systems (2010)Delay and rate-optimal control in a multi-class priority queue with adjustable service rates (2012)A Characterization of Waiting Time Performance Realizable by Single-Server Queues (1980)Optimal queueing discipline for real-time traffic at ATM switching nodes (1990)Resource Allocation Among Agents with MDP-Induced Preferences (2006)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)Networks of Waiting Lines (1957)Applying a New Device in the Optimization of Exponential Queuing Systems (1975)Extremal Splittings of Point Processes (1985)Deciding Which Queue to Join: Some Counterexamples (1986)Optimal control of service rates in networks of queues (1987)Optimal control of admission to a quenching system (1985)Boundary value problems in queueing theory (1988)Denumerable Constrained Markov Decision Processes and Finite Approximations (1994)Comparison Methods for Queues and Other Stochastic Models (1984)Single-server queues with impatient customers (1984)Introduction to Queueing Networks (1987)Rejection rules in theM/G/1 queue (1995)SCHEDULING IMPATIENT JOBS IN A CLEARING SYSTEM WITH INSIGHTS ON PATIENT TRIAGE IN MASS CASUALTY INCIDENTS (2008)Asymptotic analysis of queueing systems with reneging: A survey of results for FIFO, single class models (2011)Two competing queues with linear costs and geometric service requirements: the μc-rule is often optimal (1985)Applications of Markov Decision Processes in Communication Networks (2002)Monotonicity in Markov Reward and Decision Chains: Theory and Applications (2006)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

  • 1984Optimal control of two interacting service stations282 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
  • 1985K competing queues with geometric service requirements and linear costs: The μc-rule is always optimal103 cited
  • 1989Optimal scheduling with strict deadlines99 cited
  • 1986Optimal priority assignment with hard constraint64 cited
  • 1988Optimal scheduling of interactive and noninteractive traffic in telecommunication systems46 cited
  • 1989Optimal priority assignment: a time sharing approach40 cited

Cited by

No citing works inside the corpus for this window.

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