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

DOI10.1016/0377-2217(93)90064-TzbMath0797.90032OpenAlexW1974608535MaRDI QIDQ2367368

Bruno Viscolani

Publication date: 25 August 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(93)90064-t

zbMATH Keywords

\(M/M/1\) queueing subsystemsmaximum queue lengths

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Related Items (1)

Approximate vs. exact algorithms to solve the maximum line length problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Technical Note—There are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs
• Optimal Server Allocation in a System of Multi-Server Stations
• Optimal Order of Servers for Tandem Queues in Light Traffic
• On Server Allocation in Multiple Center Manufacturing Systems
• Note—On the Marginal Benefit of Adding Servers to G/GI/m Queues
• A Classified Bibliography of Research on Optimal Design and Control of Queues
• The Economic Service Rate

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