Dynamic Scheduling of a Multiclass Fluid Network

From MaRDI portal
Revision as of 19:33, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4285167


DOI10.1287/opre.41.6.1104zbMath0791.90023OpenAlexW2054532229MaRDI QIDQ4285167

Hong Chen, David D. W. Yao

Publication date: 13 July 1994

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

Full work available at URL: https://doi.org/10.1287/opre.41.6.1104



Related Items

Discrete-review policies for scheduling stochastic networks: trajectory tracking and fluid-scale asymptotic optimality., Fluid analysis of an input control problem, Near optimal control of queueing networks over a finite time horizon, A fuzzy nonlinear programming approach for optimizing the performance of a four-objective fluctuation smoothing rule in a wafer fabrication factory, Control of Patient Flow in Emergency Departments, or Multiclass Queues with Deadlines and Feedback, Correction: Brownian models of open processing networks: canonical representation of workload, Model Predictive Control for Dynamic Resource Allocation, Queueing Network Controls via Deep Reinforcement Learning, The archievable region method in the optimal control of queueing systems; formulations, bounds and policies, Performance evaluation of scheduling control of queueing networks: Fluid model heuristics, Optimal control of a two-server flow-shop network, Efficient Bayesian shape-restricted function estimation with constrained Gaussian process priors, Applications of fluid models in service operations management, Queueing systems with leadtime constraints: a fluid-model approach for admission and sequencing control, Optimal production planning in pull flow lines with multiple products, Optimal scheduling of parallel queues using stochastic flow models, Brownian models of open processing networks: Canonical representation of workload., Regenerative Simulation for Queueing Networks with Exponential or Heavier Tail Arrival Distributions