Symbolic computation of moments in priority queues
From MaRDI portal
Publication:2884536
DOI10.1287/IJOC.14.3.261.115zbMATH Open1238.90039OpenAlexW2118552209MaRDI QIDQ2884536FDOQ2884536
Authors: Steve Derkic, James E. Stafford
Publication date: 30 May 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.14.3.261.115
Recommendations
- scientific article; zbMATH DE number 431646
- scientific article; zbMATH DE number 1766720
- Symbolic higher-order moments of the waiting time in an M/G/1 queue with random order of service
- The time-dependent problem for a queue with preemptive priorities
- Recursive computation of steady-state probabilities in priority queues
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)
Cited In (3)
This page was built for publication: Symbolic computation of moments in priority queues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2884536)