SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Who should be given priority in a queue?
7 references·2 citing·30 second hop
Who should be given priority in a queue? (2005)Who should be given priority in a queue?Waiting times in queues with relative priorities (2006)Waiting times in queues with …To Queue or Not to Queue: Equilibrium Behavior in Queueing Systems (2003)To Queue or Not to Queue: Equ…A decomposition theorem and related results for the discriminatory processor sharing queue (1994)A decomposition theorem and r…Optimal Incentive-Compatible Priority Pricing for the M/M/1 Queue (1990)Optimal Incentive-Compatible …Sharing a Processor Among Many Job Classes (1980)Sharing a Processor Among Man…Queueing Systems, Volume 2: Computer Applications. (1978)Queueing Systems, Volume 2: C…Congestion Tolls for Poisson Queuing Processes (1975)Congestion Tolls for Poisson …Strategic Overtaking in a Monopolistic M/M/1 Queue (2015)Strategic Overtaking in a Mon…The use of relative priorities in optimizing the performance of a queueing system (2007)The use of relative prioritie…The Regulation of Queue Size by Levying Tolls (1969)Matrix-Geometric Solutions to Stochastic Models (1984)Information Sharing and Supply Chain Coordination (2003)On the Value of Commitment and Availability Guarantees When Selling to Strategic Consumers (2008)On-Demand Service Platforms (2016)Fundamentals of Queueing Theory. (1977)Fundamentals of Queueing Theory (1999)Priority Assignment in Waiting Line Problems (1954)A survey on discriminatory processor sharing (2006)A Proof for the Queuing Formula: L = λ W (1961)User Delay Costs and Internal Pricing for a Service Facility (1990)Analysis and Comparison of Queues with Different Levels of Delay Information (2007)Quality–Speed Conundrum: Trade-offs in Customer-Intensive Services (2010)Time-shared Systems (1967)Waiting Time Distributions for Processor-Sharing Systems (1970)Processor-sharing queues: Some progress in analysis (1987)Generalized processor sharing queues (2003)Exact and approximate analysis of sojourn times in finite discriminatory processor sharing queues (2005)Open, Closed, and Mixed Networks of Queues with Different Classes of Customers (1975)The multiple phase service network with generalized processor sharing (1979)M/G/c Queueing Systems with Multiple Customer Classes: Characterization and Control of Achievable Performance Under Nonpreemptive Priority Rules (1988)Processor sharing: A survey of the mathematical theory (2007)Asian Drama: An Inquiry into the Poverty of Nations (1969)An Equilibrium Queuing Model of Bribery (1985)Pricing in Service Systems with Rational Balking and Abandonment of Time‐Sensitive Customers (2021)Capacity Choice and Allocation: Strategic Behavior and Supply Chain Performance (1999)Pricing of Conspicuous Goods: A Competitive Analysis of Social Effects (2005)A Basic Dynamic Routing Problem and Diffusion (1978)Resource Sharing for Efficiency in Traffic Systems (1981)When Does the Devil Make Work? An Empirical Study of the Impact of Workload on Worker Productivity (2014)
this work references cited by second hop

References

  • 2003To Queue or Not to Queue: Equilibrium Behavior in Queueing Systems1,052 cited
  • 1978Queueing Systems, Volume 2: Computer Applications.550 cited
  • 1990Optimal Incentive-Compatible Priority Pricing for the M/M/1 Queue548 cited
  • 1975Congestion Tolls for Poisson Queuing Processes492 cited
  • 1980Sharing a Processor Among Many Job Classes175 cited
  • 2006Waiting times in queues with relative priorities28 cited
  • 1994A decomposition theorem and related results for the discriminatory processor sharing queue28 cited

Cited by

  • 2007The use of relative priorities in optimizing the performance of a queueing system21 cited
  • 2015Strategic Overtaking in a Monopolistic M/M/1 Queue21 cited

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