Algorithm to find the optimal queueing discipline in a system with branching streams of secondary customers

DOI10.1007/BF02742084zbMATH Open0936.68015OpenAlexW2056142035MaRDI QIDQ1280972

K. Appert

Publication date: 15 March 1999

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02742084

zbMATH Keywords

queueinginformation-retrieval

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Title not available (Why is that?)
• Optimization of mean queue lengths in a queueing system with branching flows of secondary demands
• Time-Sharing Service Systems. I

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Optimal arrangements of queuing systems with FIFO service discipline 👍 👎
• Optimization of mean queue lengths in a queueing system with branching flows of secondary demands 👍 👎
• Optimal server assignment in a two-stage tandem queueing system 👍 👎
• A hybrid algorithm for queueing systems 👍 👎
• THE ALLOCATION OF CUSTOMERS IN A DISCRETE-TIME MULTI-SERVER QUEUEING SYSTEM 👍 👎
• Algorithms for the multi-server queue with phase type service 👍 👎
• An algorithm for sub-optimal routeing in series-parallel queueing networks 👍 👎
• Multi-server retrial queue with second optional service: algorithmic computation and optimisation 👍 👎

This page was built for publication: Algorithm to find the optimal queueing discipline in a system with branching streams of secondary customers

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