Maximum throughput versus minimum queue: a Martingale approach

DOI10.1016/0270-0255(86)90064-3MaRDI QIDQ4721359zbMATH OpenOpenAlexFDO

Authors Mou-Hsiung Chang

Publication date 1986

Published in Mathematical Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0270-0255(86)90064-3

zbMATH Keywords

admission policymartingale theorystochastic control

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Optimal stochastic control (93E20)

Recommendations

• On queueing systems with variable intensities (martingale approach)
• Asymptotic analysis of queueingnetworks
• Martingale methods for analysing single-server queues
• scientific article; zbMATH DE number 3866340
• Maximizing throughput in queueing networks with limited flexibility
• Maximizing Throughput in Queueing Networks with Limited Flexibility
• Throughput maximization of queueing networks with simultaneous minimization of service rates and buffers
• scientific article; zbMATH DE number 431649

Cited in

(2)

• A martingale approach to the slow server problem
• scientific article; zbMATH DE number 3923836 (Why is no real title available?)

This page was built for publication: Maximum throughput versus minimum queue: a Martingale approach

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