Near optimal control of queueing networks over a finite time horizon

DOI10.1007/s10479-008-0443-xzbMath1169.90346OpenAlexW1964613088MaRDI QIDQ839876

Yoni Nazarathy, Gideon Weiss

Publication date: 3 September 2009

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-008-0443-x

zbMATH Keywords

multi-class queueing networksfluid approximationscontinuous linear programminginfinite virtual queuesqueueing controlmaximum pressure policies

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Queues and service in operations research (90B22)

Related Items (14)

Unnamed Item ⋮ A push-pull network with infinite supply of work ⋮ Fluid Models of Parallel Service Systems Under FCFS ⋮ A fluid approach to large volume job shop scheduling ⋮ Scheduling for a processor sharing system with linear slowdown ⋮ Solution algorithms for a class of continuous linear programs with fuzzy valued objective functions ⋮ Time-Varying Semidefinite Programming: Path Following a Burer–Monteiro Factorization ⋮ Dynamic server allocation for unstable queueing networks with flexible servers ⋮ Weak convergence and fluid limits in optimal time-to-empty queueing control problems ⋮ Static Routing in Stochastic Scheduling: Performance Guarantees and Asymptotic Optimality ⋮ Stability of multi-class queueing networks with infinite virtual queues ⋮ A simplex-type algorithm for continuous linear programs with constant coefficients ⋮ Minimal and Locally Edge Minimal Fluid Models for Resource-Sharing Networks ⋮ A Restless Bandit Model for Resource Allocation, Competition, and Reservation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A push-pull network with infinite supply of work
• Analysis of a simple Markovian re-entrant line with infinite supply of work under the LBFS policy
• A simplex based algorithm to solve separated continuous linear programs
• Diffusion approximations for open multiclass queueing networks: Sufficient conditions involving state space collapse
• State space collapse with application to heavy traffic limits for multiclass queueing networks
• Dynamic scheduling in multiclass queueing networks: Stability under discrete-review policies
• Dynamic control of Brownian networks: State space collapse and equivalent workload formulations
• In search of sensitivity in network optimization
• A broader view of Brownian networks
• MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic
• Brownian models of open processing networks: Canonical representation of workload.
• Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling
• Value iteration and optimization of multiclass queueing networks
• A push-pull queueing system
• Discrete-review policies for scheduling stochastic networks: trajectory tracking and fluid-scale asymptotic optimality.
• On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models
• Asymptotic optimality of maximum pressure policies in stochastic processing networks
• Sequencing and Routing in Multiclass Queueing Networks Part I: Feedback Regulation
• Jackson networks with unlimited supply of work
• A new continuous model for job-shop scheduling
• Random Yield, Rework and Scrap in a Multistage Batch Manufacturing Environment
• An Algorithm for a Class of Continuous Linear Programs
• Dynamic Scheduling of a Multiclass Fluid Network
• Sequencing and Routing in Multiclass Queueing Networks Part II: Workload Relaxations
• A TWO-NODE JACKSON NETWORK WITH INFINITE SUPPLY OF WORK
• Adaptive back-pressure congestion control based on local information
• Maximum Pressure Policies in Stochastic Processing Networks
• Bottleneck Problems and Dynamic Programming

This page was built for publication: Near optimal control of queueing networks over a finite time horizon