Pages that link to "Item:Q4306982"

The following pages link to Performance bounds for queueing networks and scheduling policies (Q4306982):

Displaying 41 items.

• Approximate linear programming for networks: average cost bounds (Q342031) (← links)
• Asymptotically tight steady-state queue length bounds implied by drift conditions (Q373455) (← links)
• On the performance evaluation of multi-guarded marked graphs with single-server semantics (Q708894) (← links)
• Filtering policies in loss queueing network location problems (Q816422) (← links)
• Analysis of a simple Markovian re-entrant line with infinite supply of work under the LBFS policy (Q854999) (← links)
• On deciding stability of multiclass queueing networks under buffer priority scheduling policies (Q983890) (← links)
• Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines (Q1268222) (← links)
• New linear program performance bounds for queueing networks (Q1289396) (← links)
• Asymptotic loss of priority scheduling policies in closed re-entrant lines: A computational study (Q1303548) (← links)
• Delay performance in stochastic processing networks with priority service. (Q1400351) (← links)
• Two-server closed networks in heavy traffic: diffusion limits and asymptotic optimality. (Q1872397) (← links)
• Performance of multiclass Markovian queueing networks via piecewise linear Lyapunov functions (Q1872422) (← links)
• Performance analysis of scheduling policies in re-entrant manufacturing systems (Q1906947) (← links)
• The archievable region method in the optimal control of queueing systems; formulations, bounds and policies (Q1923638) (← links)
• Computational geometric approach to submodular function minimization for multiclass queueing systems (Q1926646) (← links)
• Non-product form equilibrium probabilities in a class of two-station closed reentrant queueing networks (Q1945444) (← links)
• Delay performance of data-center queue with setup policy and abandonment (Q2212276) (← links)
• Coding and control for communication networks (Q2269497) (← links)
• Bounds on linear PDEs via semidefinite optimization (Q2494516) (← links)
• Validity of heavy traffic steady-state approximations in generalized Jackson networks (Q2494573) (← links)
• Decentralised, multi-objective driven scheduling for reentrant shops: a conceptual development and a test case (Q2566702) (← links)
• Dynamic scheduling for queueing networks derived from discrete-review policies (Q2702296) (← links)
• (Q2730382) (← links)
• A LINEAR PROGRAMMING APPROACH TO THE STEADY-STATE ANALYSIS OF REFLECTED BROWNIAN MOTION (Q2746225) (← links)
• (Q2970336) (← links)
• Performance bounds and suboptimal policies for linear stochastic control via LMIs (Q3098498) (← links)
• Characterization and Optimization of Achievable Performance in General Queueing Systems (Q3833401) (← links)
• Properties and performance bounds for closed free choice synchronized monoclass queueing networks (Q3986804) (← links)
• Bounds for Design Parameters in Queues (Q4024151) (← links)
• Stochastic delay bounds of fair queuing policies by analyzing weighted round robin-related policies (Q4538668) (← links)
• Allocating work in process in a multiple-product CONWIP system with lost sales (Q4671381) (← links)
• Study of a scheduling policy for diverse deadline-based quality of service (Q4779272) (← links)
• (Q4791875) (← links)
• Computing Stationary Expectations in Level-Dependent QBD Processes (Q4918569) (← links)
• Comparing LP Bounds for Queueing Networks (Q4974818) (← links)
• Scheduling and Control of Queueing Networks (Q5011862) (← links)
• Queueing Network Controls via Deep Reinforcement Learning (Q5084497) (← links)
• Performance bounds for stochastic timed Petri nets (Q5096370) (← links)
• Approximate dynamic programming via iterated Bellman inequalities (Q5256802) (← links)
• QRF (Q5270668) (← links)
• Heavy-Traffic Analysis of Queueing Systems with No Complete Resource Pooling (Q5870370) (← links)