A Tight 2-Approximation for Preemptive Stochastic Scheduling

Mathematics of Operations Research - United States
doi 10.1287/moor.2014.0653
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Related search

Approximation Schemes for Preemptive Weighted Flow Time

2002English

Semi-Online Preemptive Scheduling: One Algorithm for All Variants

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
2010English

A 2-Approximation Algorithm for Stochastic Inventory Control Models With Lost Sales

Mathematics of Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchMathematics
2008English

Tight Approximation Algorithm for Connectivity Augmentation Problems

Journal of Computer and System Sciences
Computer NetworksApplied MathematicsCommunicationsComputational TheoryMathematicsTheoretical Computer Science
2008English

Tight Approximation Bounds for Greedy Frugal Coverage Algorithms

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Jitter-Approximation Tradeoff for Periodic Scheduling

Wireless Networks
Computer NetworksElectronic EngineeringInformation SystemsElectricalCommunications
2006English

Polynomial Approximation Method for Stochastic Programming.

English

Rollout Algorithms for Stochastic Scheduling Problems

English

Formal Verification of Real-Time Systems With Preemptive Scheduling

Real-Time Systems
ControlSystems EngineeringOptimizationElectronic EngineeringComputer NetworksSimulationCommunicationsComputer Science ApplicationsElectricalModeling
2008English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy