Brownian Networks with Discretionary Routing
From MaRDI portal
Publication:3353929
Recommendations
- Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling
- Optimal Control of a Two-Station Brownian Network
- scientific article; zbMATH DE number 4076265
- Dynamic scheduling for queueing networks derived from discrete-review policies
- Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Network with Controllable Inputs
Cited in
(10)- Heavy traffic analysis of open processing networks with complete resource pooling: asymptotic optimality of discrete review policies
- A broader view of Brownian networks
- Brownian models of open processing networks: Canonical representation of workload.
- Dynamic control of Brownian networks: State space collapse and equivalent workload formulations
- DYNAMIC ROUTING OF CUSTOMERS WITH GENERAL DELAY COSTS IN A MULTISERVER QUEUING SYSTEM
- Correction: Brownian models of open processing networks: canonical representation of workload
- Optimal Control of a Two-Station Brownian Network
- Dynamic volunteer staffing in multicrop gleaning operations
- Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling
- Dynamic scheduling in manufacturing systems using Brownian approximations
This page was built for publication: Brownian Networks with Discretionary Routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3353929)