SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Duality and Other Results for M/G/1 and GI/M/1 Queues, Via a New Ballot Theorem
9 references·1 citing·27 second hop
Duality and Other Results for M/G/1 and GI/M/1 Queues, Via a New Ballot Theorem (1989)Duality and Other Results for M/G/1 and G…The single-server queue with service depending on queue size and with the preemptive-resume last-come–first-served queue discipline (1987)The single-server queue with …ON G/G/1 QUEUES WITH LIFO-P SERVICE DISCIPLINE (1986)ON G/G/1 QUEUES WITH LIFO-P S…Benes's formula for M/G/1–FIFO ‘explained' by preemptive-resume LIFO (1986)Benes's formula for M/G/1–FIF…The G/G/1 Queueing System with a Particular Queue Discipline (1981)The G/G/1 Queueing System wit…The departure process from a queueing system (1976)The departure process from a …Some Inequalities in Queuing (1968)Some Inequalities in QueuingQueues and Inventories. A Study of Their Basic Stochastic Processes (1967)Queues and Inventories. A Stu…Introduction to the Theory of Queues. (1963)Introduction to the Theory of…On Queues with Poisson Arrivals (1957)On Queues with Poisson Arriva…Representing workloads in GI/G/1 queues through the preemptive-resume LIFO queue discipline (1988)Representing workloads in GI/…Matrix-Geometric Solutions to Stochastic Models (1984)Convex ordering of sojourn times in single-server queues: extremal properties of FIFO and LIFO service disciplines (1987)Waiting Times When Queues are in Tandem (1957)On Erlang's Formula (1969)Networks of queues (1976)The theory of queues with a single server (1952)Fluctuation theory in continuous time (1975)Fluctuation theory in continuous time (1975)Processor sharing: A survey of the mathematical theory (2007)Introduction to Queueing Theory (1982)Poisson Arrivals See Time Averages (1982)An introduction to queueing theory (1993)Approximation Methods for Queues with Application to the Fixed-Cycle Traffic Light (1965)Queueing output processes (1976)The generalized expansion method for open finite queueing networks (1987)Chapter 5 Performance evaluation of production networks (1993)Geometric Distributions in the Theory of Queues (1959)Generalizing the Pollaczek-Khintchine Formula to Account for Arbitrary Work Removal (1996)Fundamentals of Queueing Theory. (1977)Fundamentals of queueing theory (2nd ed.). (1985)Analysis of theGI/GI/1 Queue and its Variations via the LCFS Preemptive Resume Discipline and Its Random Walk Interpretation (1988)A General Class of Bulk Queues with Poisson Input (1967)Stochastic Processes for Insurance and Finance (1999)Coping with Time‐Varying Demand When Setting Staffing Requirements for a Service System (2007)Stochastic clearing systems (1974)A Consumer Preference Approach to the Planning of Rural Primary Health-Care Facilities (1976)The Probability of Eventual Ruin in the Compound Binomial Model (1989)
this work references cited by second hop

References

  • 1963Introduction to the Theory of Queues.961 cited
  • 1968Some Inequalities in Queuing191 cited
  • 1957On Queues with Poisson Arrivals102 cited
  • 1967Queues and Inventories. A Study of Their Basic Stochastic Processes68 cited
  • 1976The departure process from a queueing system29 cited
  • 1981The G/G/1 Queueing System with a Particular Queue Discipline25 cited
  • 1986ON G/G/1 QUEUES WITH LIFO-P SERVICE DISCIPLINE21 cited
  • 1986Benes's formula for M/G/1–FIFO ‘explained' by preemptive-resume LIFO19 cited
  • 1987The single-server queue with service depending on queue size and with the preemptive-resume last-come–first-served queue discipline17 cited

Cited by

  • 1988Representing workloads in GI/G/1 queues through the preemptive-resume LIFO queue discipline15 cited

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