Discrete-review policies for scheduling stochastic networks: Trajectory tracking and fluid-scale asymptotic optimality

C Maglaras - The Annals of Applied Probability, 2000 - projecteuclid.org
This paper describes a general approach for dynamic control of stochastic networks based
on fluid model analysis, where in broad terms, the stochastic network is approximated by its …

The linear programming approach to approximate dynamic programming

DP De Farias, B Van Roy - Operations research, 2003 - pubsonline.informs.org
The curse of dimensionality gives rise to prohibitive computational requirements that render
infeasible the exact solution of large-scale stochastic control problems. We study an efficient …

[图书][B] Control techniques for complex networks

S Meyn - 2008 - books.google.com
Power grids, flexible manufacturing, cellular communications: interconnectedness has
consequences. This remarkable book gives the tools and philosophy you need to build …

Queueing network controls via deep reinforcement learning

JG Dai, M Gluzman - Stochastic Systems, 2022 - pubsonline.informs.org
Novel advanced policy gradient (APG) methods, such as trust region policy optimization and
proximal policy optimization (PPO), have become the dominant reinforcement learning …

Risk-sensitive optimal control for Markov decision processes with monotone cost

VS Borkar, SP Meyn - Mathematics of Operations Research, 2002 - pubsonline.informs.org
The existence of an optimal feedback law is established for the risk-sensitive optimal control
problem with denumerable state space. The main assumptions imposed are irreducibility …

The policy iteration algorithm for average reward Markov decision processes with general state space

SP Meyn - IEEE Transactions on Automatic Control, 1997 - ieeexplore.ieee.org
The average cost optimal control problem is addressed for Markov decision processes with
unbounded cost. It is found that the policy iteration algorithm generates a sequence of …

On optimal call admission control in resource-sharing system

E Altman, T Jiménez, G Koole - IEEE Transactions on …, 2001 - ieeexplore.ieee.org
In this paper, we consider call admission control of multiple classes without waiting room.
We use event-based dynamic programming for our model. We show that sometimes the …

Queueing-theoretic approaches for dynamic scheduling: a survey

D Terekhov, DG Down, JC Beck - Surveys in Operations Research and …, 2014 - Elsevier
Within the combinatorial scheduling community, there has been an increasing interest in
modelling and solving scheduling problems in dynamic environments. Such problems have …

Dynamic server assignment in multiclass queues with shifts, with applications to nurse staffing in emergency departments

CW Chan, M Huang, V Sarhangian - Operations Research, 2021 - pubsonline.informs.org
Many service systems are staffed by workers who work in shifts. In this article, we study the
dynamic assignment of servers to different areas of a service system at the beginning of …

Queueing network models in the design and analysis of semiconductor wafer fabs

S Kumar, PR Kumar - IEEE Transactions on Robotics and …, 2001 - ieeexplore.ieee.org
We provide an introduction to the application of queueing network models to the design and
analysis of semiconductor wafer fabs. We introduce the basic issues that confront the system …