The archievable region method in the optimal control of queueing systems; formulations, bounds and policies
type: Item
instance of: scholarly article
title: The archievable region method in the optimal control of queueing systems; formulations, bounds and policies
zbMATH Open document ID: 0857.60093
DOI: 10.1007/BF01149167
published in: Queueing Systems
publication date: 1997-03-03T00:00:00Z
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 90B22
zbMATH DE Number: 933166
zbMATH Keywords: queueing networks
zbMATH Keywords: loss networks
zbMATH Keywords: multiarmed bandits
zbMATH Keywords: bounds
zbMATH Keywords: policies
zbMATH Keywords: optimization
author: Dimitris Bertsimas
MaRDI profile type: Publication
cites work: Q3770273
cites work: Q4843002
cites work: Conservation Laws, Extended Polymatroids and Multiarmed Bandit Problems; A Polyhedral Approach to Indexable Systems
cites work: Restless Bandits, Linear Programming Relaxations, and a Primal-Dual Index Heuristic
cites work: Optimization of multiclass queueing networks: Polyhedral and nonlinear characterizations of achievable performance
cites work: Branching bandits and Klimov's problem: achievable region and side constraints
cites work: Rounding algorithms for covering problems
cites work: Dynamic Scheduling of a Multiclass Fluid Network
cites work: A Characterization of Waiting Time Performance Realizable by Single-Server Queues
cites work: Characterization and Optimization of Achievable Performance in General Queueing Systems
cites work: M/G/c Queueing Systems with Multiple Customer Classes: Characterization and Control of Achievable Performance Under Nonpreemptive Priority Rules
cites work: Q3944001
cites work: Q4057976
cites work: Q4197923
cites work: Q4692329
cites work: Stochastic scheduling with order constraints
cites work: Sensitivity Analysis for Stochastic Scheduling Problems
cites work: A Priority Queue with Discounted Linear Costs
cites work: Dynamic Scheduling of a Multiclass Queue: Discount Optimality
cites work: Scheduling networks of queues: Heavy traffic analysis of a simple open network
cites work: Q3313617
cites work: On the Optimal Control of Two Queues with Server Setup Times and Its Analysis
cites work: Loss networks
cites work: Bounds on the Performance of Dynamic Routing Schemes for Highly Connected Networks
cites work: The Analysis of Random Polling Systems
cites work: Time-Sharing Service Systems. I
cites work: Performance bounds for queueing networks and scheduling policies
cites work: Dominance relations in polling systems
cites work: Cones of Matrices and Set-Functions and 0–1 Optimization
cites work: Multiple feedback at a single-server station
cites work: Performance bounds for scheduling queueing networks
cites work: Structure of a simple scheduling polyhedron
cites work: Q4298260
cites work: Dynamic scheduling of a two-class queue with setups
cites work: Optimal dynamic scheduling in Jackson networks
cites work: Scheduling with Random Service Times
cites work: Q3791100
cites work: Queuing analysis of polling models
cites work: Optimal Control of Single-Server Queuing Networks and Multi-Class M/G/1 Queues with Feedback
cites work: A lemma on the multiarmed bandit problem
cites work: A short proof of the Gittins index theorem
cites work: Extensions of the multiarmed bandit problem: The discounted case
cites work: On the Gittins index for multiarmed bandits
cites work: Branching Bandit Processes
cites work: Q3882215
cites work: Q3815845
full work available at URL: https://doi.org/10.1007/bf01149167
OpenAlex ID: W2016798673
description: scientific article; zbMATH DE number 933166