Concavity of the throughput of tandem queueing systems with finite buffer storage space

DOI10.2307/1427472zbMATH Open0713.60100OpenAlexW2334180083MaRDI QIDQ3198668FDOQ3198668

Authors: Ludolf E. Meester, J. George Shanthikumar 

Publication date: 1990

Published in: Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/1427472

Recommendations

• Stochastic concavity of throughput in series of queues with finite buffers
• scientific article; zbMATH DE number 823434
• On the optimal design of tandem queueing systems with finite buffers
• Throughput maximization for two station tandem systems: a proof of the Andradóttir-Ayhan conjecture
• Bounding the performance of tandem queues with finite buffer spaces

zbMATH Keywords

tandem queueing systemoptimal buffer space allocationstrongly stochastically increasing

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)

Cited In (21)

• Application of the cross-entropy method to the buffer allocation problem in a simulation-based environment
• Partial pooling in tandem lines with cooperation and blocking
• How to optimize container withholding decisions for reuse in the hinterland?
• On the optimal design of tandem queueing systems with finite buffers
• Title not available (Why is that?)
• Stochastic concavity of throughput in series of queues with finite buffers
• Design of manufacturing systems using queueing models
• Heuristic algorithms for buffer allocation in a production line with unreliable machines
• Scaling limits of a tandem retrial queue with common orbit and Poisson arrival process
• Concavity of system throughput and information transfer in a PAC system
• Title not available (Why is that?)
• Performance bounds on multiserver exponential tandem queues with finite buffers
• Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines
• Optimizing the throughput, service rate, and buffer allocation in finite queueing networks
• An exact solution to a class of queueing systems with multipurpose counters
• Pooling in tandem queueing networks with non-collaborative servers
• Second order properties in a tandem queue with general blocking
• Bounding the performance of tandem queues with finite buffer spaces
• Properties of serial kanban systems
• Throughput maximization of queueing networks with simultaneous minimization of service rates and buffers
• Structured buffer-allocation problems

This page was built for publication: Concavity of the throughput of tandem queueing systems with finite buffer storage space

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