Optimal design of a multiservice system: The line-penalty problem

From MaRDI portal





The author considers a system which consists of a set of \(M/M/1\) queueing subsystems, using the same scarce resources, but otherwise running independently. The problem of minimizing the maximum queue lengths is formulated and its poperties are investigated.











This page was built for publication: Optimal design of a multiservice system: The line-penalty problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2367368)