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 …
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 …
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 …
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 …
proximal policy optimization (PPO), have become the dominant reinforcement learning …
Risk-sensitive optimal control for Markov decision processes with monotone cost
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 …
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 …
unbounded cost. It is found that the policy iteration algorithm generates a sequence of …
On optimal call admission control in resource-sharing system
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 …
We use event-based dynamic programming for our model. We show that sometimes the …
Queueing-theoretic approaches for dynamic scheduling: a survey
Within the combinatorial scheduling community, there has been an increasing interest in
modelling and solving scheduling problems in dynamic environments. Such problems have …
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
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 …
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
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 …
analysis of semiconductor wafer fabs. We introduce the basic issues that confront the system …