scientific article; zbMATH DE number 958364

zbMath0860.90059MaRDI QIDQ5687690

Nico M. van Dijk

Publication date: 21 April 1997

Full work available at URL: https://eudml.org/doc/27580

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

tandem queueing networkstochastic service networkscontinuous-state Markov reward recursion

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Applications of renewal theory (reliability, demand theory, etc.) (60K10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Infinitesimal and finite perturbation analysis for queueing networks
• A formal proof for the insensitivity of simple bounds for finite multi- server non-exponential tandem queues based on monotonicity results
• Simple bounds and monotonicity results for finite multi-server exponential tandem queues
• Non-negative matrices and Markov chains.
• Monotonicity of the Throughput of a Closed Queueing Network in the Number of Jobs
• Simple bounds for queueing systems with breakdowns
• A Concept of Monotonicity and Its Characterization for Closed Queueing Networks
• Convergence of parameter sensitivity estimates in a stochastic experiment
• Stochastic Comparisons for Non-Markov Processes
• Extensions of infinitesimal perturbation analysis
• Sensitivity analysis and optimization of throughput in a production line with blocking
• Perturbation theory for unbounded Markov reward processes with applications to queueing
• Perturbation theory for Markov reward processes with applications to queueing systems
• The reduction of perturbed Markov generators
• First-order perturbation analysis of a simple multi-class finite source queue
• Simple Bounds for Finite Single-Server Exponential Tandem Queues
• Throughput bounds for closed queueing networks with queue-dependent service rates
• Stochastic Monotonicity of the Queue Lengths in Closed Queueing Networks
• Monotonicity of throughput in non-Markovian networks
• Comparing counting processes and queues
• The Condition of a Finite Markov Chain and Perturbation Bounds for the Limiting Probabilities
• A note on extended uniformization for non-exponential stochastic networks
• Networks of queues and the method of stages
• The insensitivity of stationary probabilities in networks of queues
• Partial balance and insensitivity
• Perturbation theory and finite Markov chains

This page was built for publication: