A discrete-time single-server queue with set-up time

DOI10.1016/0304-4149(78)90007-8MaRDI QIDQ1251863zbMATH OpenOpenAlexFDO

Authors K. Appert

Publication date 1978

Published in Stochastic Processes and their Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-4149(78)90007-8

zbMATH Keywords

Discrete-Time Single-Server QueueDistributions of the Actual Waiting TimeKingman's Algebraic StructureVirtual Waiting Time

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25)

Cites work

• A GI/M/1 queue with a modified service mechanism
• A probability limit theorem with application to a generalisation of queueing theory
• Discrete queues with one server
• scientific article; zbMATH DE number 3488397 (Why is no real title available?)
• scientific article; zbMATH DE number 3521328 (Why is no real title available?)
• scientific article; zbMATH DE number 3431644 (Why is no real title available?)
• scientific article; zbMATH DE number 3240796 (Why is no real title available?)
• scientific article; zbMATH DE number 3292535 (Why is no real title available?)
• scientific article; zbMATH DE number 3059214 (Why is no real title available?)
• scientific article; zbMATH DE number 3074492 (Why is no real title available?)
• scientific article; zbMATH DE number 3074493 (Why is no real title available?)
• scientific article; zbMATH DE number 3084689 (Why is no real title available?)
• Limit theorems for generalized single server queues
• Limit Theorems for Generalized Single Server Queues: The Exceptional System
• On a Generalized M/G/1 Queuing Process in Which the First Customer of Each Busy Period Receives Exceptional Service
• On the algebra of queues
• On the busy period in the queueing system GI/G/1
• On the Busy Period of a Single Server Bulk Queue with a Modified Service Mechanism
• On the busy period of the modified GI/G/1 queue
• On the General Time Dependent Queue with a Single Server
• Single server queues with modified service mechanisms
• Spitzer's Formula: A Short Proof
• The total waiting time in a busy period of a stable single-server queue, I.
• The use of Spitzer's identity in the investigation of the busy period and other quantities in the queue GI/G/1

Cited in

(1)

• The discrete-time single-server queue

This page was built for publication: A discrete-time single-server queue with set-up time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1251863)