Inferring most likely queue length from transactional data

DOI10.1016/0167-6377(96)00027-2zbMath0873.90036OpenAlexW2039985813MaRDI QIDQ1360114

Dragomir D. Dimitrijevic

Publication date: 30 October 1997

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

Full work available at URL: https://doi.org/10.1016/0167-6377(96)00027-2

zbMATH Keywords

transactional datalength of an M/G/1 queuequeue-inferencing algorithms

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (1)

A survey of parameter and state estimation in queues

Cites Work

• A two-point Markov chain boundary-value problem
• The Queue Inference Engine: Deducing Queue Statistics from Transactional Data
• A Vehicle Routing Problem with Stochastic Demand
• Exploiting Markov chains to infer queue length from transactional data
• Unnamed Item

This page was built for publication: Inferring most likely queue length from transactional data