Optimal priorities in GI|Gn|1 queue

DOI10.1007/BF01068378MaRDI QIDQ4007381zbMATH OpenFDO

Authors

Publication date 27 September 1992

Published in Cybernetics (Search for Journal in Brave)

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

zbMATH Keywords

polynomial-time algorithm

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Applications of mathematical programming (90C90)

Recommendations

• Optimal selection of mean waiting times in \(GI| M_ n| 1\) systems
• Optimal Control of an M/G/1 Priority Queue Via N-Control
• Optimization of average waiting time functions in \(GI_ n/M/1\) queueing systems
• A polynomial-time algorithm for computing an optimal admission policy in a GI/M/1/N queue
• scientific article; zbMATH DE number 31705

Cites work

• Controlled queueing systems
• scientific article; zbMATH DE number 3876362 (Why is no real title available?)
• scientific article; zbMATH DE number 3422402 (Why is no real title available?)
• Polynomial algorithms in linear programming

Cited in

(7)

• On the M₂/G/_2/1/ queue with relative dynamic priorities
• A polynomial-time algorithm for computing an optimal admission policy in a GI/M/1/N queue
• Applying optimization theory to study extremal GI/GI/1 transient mean waiting times
• Minimizing Delays in the GI/G/1 Queue
• scientific article; zbMATH DE number 31705 (Why is no real title available?)
• Priority Assignment in Waiting Line Problems
• Optimization of average waiting time functions in \(GI_ n/M/1\) queueing systems

This page was built for publication: Optimal priorities in GI|Gn|1 queue

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