SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Nudge: Stochastically Improving upon FCFS
16 references·0 citing·39 second hop
Nudge: Stochastically Improving upon FCFS (2021)Nudge: Stochastically Improving upon FCFSWaiting time distributions in the accumulating priority queue (2013)Waiting time distributions in…Is Tail-Optimal Scheduling Possible? (2012)Is Tail-Optimal Scheduling Po…Tails in scheduling (2007)Tails in schedulingLargest Weighted Delay First Scheduling: Large Deviations and Optimality (2001)Largest Weighted Delay First …Price, delivery time guarantees and capacity selection (1998)Price, delivery time guarante…Asymptotics for M/G/1 low-priority waiting-time tail probabilities (1997)Asymptotics for M/G/1 low-pri…How Long Should a Customer Wait for Service? (1991)How Long Should a Customer Wa…Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations (1985)Stochastic Decompositions in …Poisson Arrivals See Time Averages (1982)Poisson Arrivals See Time Ave…Queueing Systems, Volume 2: Computer Applications. (1978)Queueing Systems, Volume 2: C…Inequalities in the Theory of Queues (1970)Inequalities in the Theory of…Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline (1968)Letter to the Editor—A Proof …The Queue M/G/1 With Feedback to Lower Priority Queues (1967)The Queue M/G/1 With Feedback…The Queue M/G/1 with the Shortest Remaining Processing Time Discipline (1966)The Queue M/G/1 with the Shor…On a Generalized M/G/1 Queuing Process in Which the First Customer of Each Busy Period Receives Exceptional Service (1964)On a Generalized M/G/1 Queuin…A martingale inequality in the theory of queues (1964)A martingale inequality in th…On the theory of queues with many servers (1955)Approximations in finite-capacity multi-server queues by Poisson arrivals (1978)Performance bounds for queueing networks and scheduling policies (1994)Tractable stochastic analysis in high dimensions via robust optimization (2012)Pseudo-conservation laws in cyclic-service systems (1987)Queuing analysis of polling models (1988)Polling systems: applications, modeling, and optimization (1990)An introduction to queueing theory (1993)Priority Assignment in Waiting Line Problems (1954)A Proof for the Queuing Formula: L = λ W (1961)A Classified Bibliography of Research on Optimal Design and Control of Queues (1977)A simple dynamic routing problem (1980)Analysis of SRPT scheduling (2001)Introduction to the Theory of Queues. (1963)A note on stochastic decomposition in a GI/G/1 queue with vacations or set-up times (1985)Queueing Systems with Service Interruptions (1986)Server farms with setup costs (2010)Competing against time: how time-based competition is reshaping global markets (1990)Optimal Incentive-Compatible Priority Pricing for the M/M/1 Queue (1990)Time-based competition: the next battleground in American manufacturing (1991)Price and Time Competition for Service Delivery (2000)Coordination of Pricing and Inventory Decisions: A Survey and Classification (2004)Demand Functions in Decision Modeling: A Comprehensive Survey and Research Directions (2013)Comparison Methods for Queues and Other Stochastic Models. (1986)Applied Probability and Queues (1987)Stochastic Modeling and the Theory of Queues (1989)Sampling at subexponential times, with queueing applications (1999)Analysis, Design, and Control of Queueing Systems (2002)Bursty Human Dynamics (2017)The stability of a queue with non-independent inter-arrival and service times (1962)Effective bandwidths at multi-class queues (1991)Stability, queue length, and delay of deterministic and stochastic queueing networks (1994)Classifying scheduling policies with respect to unfairness in an M/GI/1 (2003)A Markov Modulated Characterization of Packetized Voice and Data Traffic and Related Statistical Multiplexer Performance (1986)Queueing systems with vacations ? A survey (1986)Telephone Call Centers: Tutorial, Review, and Research Prospects (2003)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

  • 1982Poisson Arrivals See Time Averages1,220 cited
  • 1985Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations621 cited
  • 1968Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline562 cited
  • 1978Queueing Systems, Volume 2: Computer Applications.550 cited
  • 1966The Queue M/G/1 with the Shortest Remaining Processing Time Discipline342 cited
  • 1998Price, delivery time guarantees and capacity selection308 cited
  • 1970Inequalities in the Theory of Queues245 cited
  • 1964On a Generalized M/G/1 Queuing Process in Which the First Customer of Each Busy Period Receives Exceptional Service225 cited
  • 2001Largest Weighted Delay First Scheduling: Large Deviations and Optimality198 cited
  • 1997Asymptotics for M/G/1 low-priority waiting-time tail probabilities145 cited
  • 1964A martingale inequality in the theory of queues114 cited
  • 1967The Queue M/G/1 With Feedback to Lower Priority Queues108 cited
  • 2013Waiting time distributions in the accumulating priority queue93 cited
  • 2007Tails in scheduling86 cited
  • 1991How Long Should a Customer Wait for Service?84 cited

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

  • 2012Is Tail-Optimal Scheduling Possible?83 cited
  • Cited by

    No citing works inside the corpus for this window.