A tight 2-approximation for preemptive stochastic scheduling
From MaRDI portal
Recommendations
Cites work
- A note on time sharing with preferred customers
- A note on time-sharing
- Approximating the stochastic Knapsack problem: the benefit of adaptivity
- Approximation in Preemptive Stochastic Online Scheduling
- Approximation in stochastic scheduling
- Approximation techniques for average completion time scheduling
- Competitive analysis of preemptive single-machine scheduling
- Completion time scheduling and the WSRPT algorithm
- Coping with Incomplete Information in Scheduling — Stochastic and Online Models
- Efficient algorithms for average completion time scheduling
- scientific article; zbMATH DE number 3883931 (Why is no real title available?)
- scientific article; zbMATH DE number 3638998 (Why is no real title available?)
- Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
- LP-based online scheduling: From single to parallel machines
- Models and Algorithms for Stochastic Online Scheduling
- On almost optimal priority rules for preemptive scheduling of stochastic jobs on parallel machines
- On the Asymptotic Optimality of a Simple On-Line Algorithm for the Stochastic Single-Machine Weighted Completion Time Problem and Its Extensions
- On-line scheduling to minimize average completion time revisited.
- Optimal Scheduling of Jobs with Exponential Service Times on Identical Parallel Processors
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling for Minimum Total Loss Using Service Time Distributions
- Scheduling jobs by stochastic processing requirements on parallel machines to minimize makespan or flowtime
- Scheduling Stochastic Jobs with a Two-Point Distribution on Two Parallel Machines
- Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions
- Scheduling tasks with exponential service times on parallel processors
- Scheduling Unrelated Machines by Randomized Rounding
- Scheduling with Random Service Times
- Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan
- Stochastic Machine Scheduling with Precedence Constraints
- Stochastic Online Scheduling Revisited
- Stochastic scheduling problems I — General strategies
- Stochastic scheduling problems II-set strategies-
- Stochastic Scheduling with Release Dates and Due Dates
- The power of \(\alpha\)-points in preemptive single machine scheduling.
Cited in
(18)- On the two-phase method for preemptive scheduling
- On preemptive scheduling: A general setting for the two-phase method
- An adversarial model for scheduling with testing
- On index policies for stochastic minsum scheduling
- Approximation in stochastic scheduling
- Unrelated machine scheduling with stochastic processing times
- Online appointment scheduling in the random order model
- Bounding the Power of Preemption in Randomized Scheduling
- On Stochastic Scheduling with In-Tree Precedence Constraints
- Greed works -- online algorithms for unrelated machine stochastic scheduling
- Approximation Algorithms for 2-Stage Stochastic Scheduling Problems
- Approximation in Preemptive Stochastic Online Scheduling
- Restricted Adaptivity in Stochastic Scheduling
- Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling
- The power of proportional fairness for nonclairvoyant polytope scheduling
- Stochastic single-machine scheduling with workload-dependent maintenance activities
- Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling
- Preemptive stochastic online scheduling on two uniform machines
This page was built for publication: A tight 2-approximation for preemptive stochastic scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5247621)
