Brownian Networks with Discretionary Routing
From MaRDI portal
Publication:3353929
DOI10.1287/opre.39.2.322zbMath0729.60086MaRDI QIDQ3353929
Publication date: 1991
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.39.2.322
90B35: Deterministic scheduling theory in operations research
90B22: Queues and service in operations research
90B10: Deterministic network models in operations research
60K20: Applications of Markov renewal processes (reliability, queueing networks, etc.)
Related Items
Dynamic Volunteer Staffing in Multicrop Gleaning Operations, Correction: Brownian models of open processing networks: canonical representation of workload, Dynamic control of Brownian networks: State space collapse and equivalent workload formulations, Brownian models of open processing networks: Canonical representation of workload., Heavy traffic analysis of open processing networks with complete resource pooling: asymptotic optimality of discrete review policies, Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling, DYNAMIC ROUTING OF CUSTOMERS WITH GENERAL DELAY COSTS IN A MULTISERVER QUEUING SYSTEM