On the relationship between work load and waiting time in single server queues with batch inputs

DOI10.1016/0167-6377(88)90052-1zbMath0644.60102MaRDI QIDQ1102636

Yoshitaka Takahashi

Publication date: 1988

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(88)90052-1

zbMATH Keywords

conservation law; single server queues; batch inputs; preemptive-resume discipline

Mathematics Subject Classification ID

60K25: Queueing theory (aspects of probability theory)

90B22: Queues and service in operations research

Related Items

Delay analysis of discrete-time priority queue with structured inputs, Priority queues with batch Poisson arrivals, On pseudo-conservation laws for the cyclic server system with compound Poisson arrivals, A note on conservation laws for a multi-class service queueing system with setup times

Cites Work

• Unnamed Item
• Waiting time in a preemptive resume system with compound-Poisson input
• A conservation law for G|G|m queueing systems
• The stationary waiting time process in single-server priority queues with general low priority arrival process
• A Proof for the Queuing Formula: L = λW
• Poisson Arrivals See Time Averages
• Technical Note—Delays in Single-Server Queues with Batch Input
• Stochastic processes with imbedded marked point processes (pmp) and thcir application in queneing
• Technical Note—A Last Word on L = λW
• Time-Dependent Solution of a Priority Queue with Bulk Arrival
• A conservation law for a wide class of queueing disciplines
• Letter to the Editor—An Alternative Proof of a Conservation Law for the Queue G/G/1
• Work-conserving priorities
• On the relation between customer and time averages in queues