scientific article; zbMATH DE number 932423
From MaRDI portal
Publication:4894801
zbMath0860.60068MaRDI QIDQ4894801
Publication date: 7 October 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Related Items (23)
Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy ⋮ Asymptotic optimality of tracking policies in stochastic networks. ⋮ Discrete-review policies for scheduling stochastic networks: trajectory tracking and fluid-scale asymptotic optimality. ⋮ Near optimal control of queueing networks over a finite time horizon ⋮ Asymptotically Optimal Inventory Control for Assemble-to-Order Systems with Identical Lead Times ⋮ Asymptotic optimality of maximum pressure policies in stochastic processing networks ⋮ Correction: Brownian models of open processing networks: canonical representation of workload ⋮ Dynamic control of Brownian networks: State space collapse and equivalent workload formulations ⋮ Queueing Network Controls via Deep Reinforcement Learning ⋮ Log-weight scheduling in switched networks ⋮ Unnamed Item ⋮ Controlled stochastic networks in heavy traffic: convergence of value functions ⋮ Applications of fluid models in service operations management ⋮ An Optimal Callback Policy for General Arrival Processes: A Pathwise Analysis ⋮ Resource sharing networks: Overview and an open problem ⋮ Large-deviations analysis of the fluid approximation for a controllable tandem queue ⋮ Queueing systems with leadtime constraints: a fluid-model approach for admission and sequencing control ⋮ Heavy traffic analysis of open processing networks with complete resource pooling: asymptotic optimality of discrete review policies ⋮ On the Control of Fork-Join Networks ⋮ Heavy traffic analysis of maximum pressure policies for stochastic processing networks with multiple bottlenecks ⋮ Brownian models of open processing networks: Canonical representation of workload. ⋮ Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies ⋮ Minimal and Locally Edge Minimal Fluid Models for Resource-Sharing Networks
This page was built for publication:
