New linear program performance bounds for closed queueing networks

DOI10.1023/A:1011217024661zbMath1027.90017OpenAlexW1494048984MaRDI QIDQ5954608

James R. Morrison, P. R. Kumar

Publication date: 4 February 2002

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1011217024661

zbMATH Keywords

performance evaluationqueueing networksasymptotic lossclosed networksclosed rentrant linesefficiency schedulingthroughput

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Deterministic scheduling theory in operations research (90B35) Queues and service in operations research (90B22)

Related Items (4)

Copositive optimization -- recent developments and applications ⋮ Non-product form equilibrium probabilities in a class of two-station closed reentrant queueing networks ⋮ Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization ⋮ QRF

This page was built for publication: New linear program performance bounds for closed queueing networks