On the inapproximability of \(M/G/K\): Why two moments of job size distribution are not enough

From MaRDI portal
Revision as of 15:39, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:849297


DOI10.1007/s11134-009-9133-xzbMath1181.90073WikidataQ56753438 ScholiaQ56753438MaRDI QIDQ849297

J. G. Dai, Mor Harchol-Balter, Varun Gupta, Bert Zwart

Publication date: 25 February 2010

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11134-009-9133-x


60K25: Queueing theory (aspects of probability theory)

90B22: Queues and service in operations research

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems


Related Items



Cites Work