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

From MaRDI portal
Revision as of 18:25, 17 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Optimal design of a multiservice system: The line-penalty problem
scientific article

    Statements

    Optimal design of a multiservice system: The line-penalty problem (English)
    0 references
    0 references
    25 August 1993
    0 references
    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.
    0 references
    0 references
    \(M/M/1\) queueing subsystems
    0 references
    maximum queue lengths
    0 references