Near optimal control of queueing networks over a finite time horizon
From MaRDI portal
Publication:839876
DOI10.1007/S10479-008-0443-XzbMATH Open1169.90346OpenAlexW1964613088MaRDI QIDQ839876FDOQ839876
Authors: 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
Recommendations
fluid approximationsmulti-class queueing networkscontinuous linear programminginfinite virtual queuesqueueing controlmaximum pressure policies
Queues and service in operations research (90B22) Stochastic network models in operations research (90B15)
Cites Work
- On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models
- Title not available (Why is that?)
- An Algorithm for a Class of Continuous Linear Programs
- A simplex based algorithm to solve separated continuous linear programs
- MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic
- Adaptive back-pressure congestion control based on local information
- Title not available (Why is that?)
- Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling
- Value iteration and optimization of multiclass queueing networks
- Sequencing and routing in multiclass queueing networks. I: Feedback regulation
- Random Yield, Rework and Scrap in a Multistage Batch Manufacturing Environment
- Sequencing and Routing in Multiclass Queueing Networks Part II: Workload Relaxations
- 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
- Title not available (Why is that?)
- Asymptotic optimality of maximum pressure policies in stochastic processing networks
- A broader view of Brownian networks
- Brownian models of open processing networks: Canonical representation of workload.
- Title not available (Why is that?)
- Maximum Pressure Policies in Stochastic Processing Networks
- Dynamic control of Brownian networks: State space collapse and equivalent workload formulations
- A new continuous model for job-shop scheduling
- Bottleneck Problems and Dynamic Programming
- Jackson networks with unlimited supply of work
- A push-pull network with infinite supply of work
- A push-pull queueing system
- Analysis of a simple Markovian re-entrant line with infinite supply of work under the LBFS policy
- In search of sensitivity in network optimization
- A TWO-NODE JACKSON NETWORK WITH INFINITE SUPPLY OF WORK
- Discrete-review policies for scheduling stochastic networks: trajectory tracking and fluid-scale asymptotic optimality.
- Dynamic Scheduling of a Multiclass Fluid Network
- Title not available (Why is that?)
- Dynamic scheduling in multiclass queueing networks: Stability under discrete-review policies
- Title not available (Why is that?)
Cited In (27)
- A restless bandit model for resource allocation, competition, and reservation
- Minimal and locally edge minimal fluid models for resource-sharing networks
- Online self-organizing network control with time averaged weighted throughput objective
- Time-Varying Semidefinite Programming: Path Following a Burer–Monteiro Factorization
- Queueing systems with leadtime constraints: a fluid-model approach for admission and sequencing control
- Optimal control of some queueing networks
- Designs of optimal switching feedback decentralized control policies for fluid queueing networks
- Dynamic safety-stocks for asymptotic optimality in stochastic networks
- Price-Directed Control of a Closed Logistics Queueing Network
- Static routing in stochastic scheduling: performance guarantees and asymptotic optimality
- Dynamic server allocation for unstable queueing networks with flexible servers
- Asymptotically optimal controls for time-inhomogeneous networks
- Weak convergence and fluid limits in optimal time-to-empty queueing control problems
- A push-pull network with infinite supply of work
- Title not available (Why is that?)
- Queueing network controls via deep reinforcement learning
- Title not available (Why is that?)
- Stability of multi-class queueing networks with infinite virtual queues
- Optimal control of a two-server flow-shop network
- Solution algorithms for a class of continuous linear programs with fuzzy valued objective functions
- Optimal control of queueing networks: an approach via fluid models
- Modeling, simulation and performance analysis of a flexible production system
- A simplex-type algorithm for continuous linear programs with constant coefficients
- Fluid models of parallel service systems under FCFS
- A fluid approach to large volume job shop scheduling
- Title not available (Why is that?)
- Scheduling for a processor sharing system with linear slowdown
This page was built for publication: Near optimal control of queueing networks over a finite time horizon
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q839876)
