An Application of the Number of Minimal Lattice Paths to the Theory of Queues

DOI10.2307/2582343zbMath0575.60096OpenAlexW4246911424MaRDI QIDQ3694425

Masashi Furukawa, Hiroshi Ohta

Publication date: 1985

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2582343

zbMATH Keywords

Catalan numberminimal lattice pathscombinatorial techniques

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (3)

Lattice path approach for busy period density of \(M/G/1\) queues using \(C_{3}\) Coxian distribution ⋮ Busy period analysis of queue: lattice path approach ⋮ Lattice path approach for busy period density of \(GIa/Gb/1\) queues using \(C_{2}\) Coxian distributions

This page was built for publication: An Application of the Number of Minimal Lattice Paths to the Theory of Queues