Approximation Algorithms for 2-Stage Stochastic Scheduling Problems
From MaRDI portal
(Redirected from Publication:5429264)
Recommendations
- An approximation scheme for stochastic linear programming and its application to stochastic integer programs
- Sampling-based approximation algorithms for multistage stochastic optimization
- Approximation Algorithms for 2-Stage Stochastic Optimization Problems
- Stochastic Online Scheduling Revisited
- A tight 2-approximation for preemptive stochastic scheduling
Cited in
(13)- A novel parallel quantum genetic algorithm for stochastic job shop scheduling
- Speed-robust scheduling. Sand, bricks, and rocks
- Fast primal-dual distributed algorithms for scheduling and matching problems
- A data intensive heuristic approach to the two-stage streaming scheduling problem
- Approximability of the two-stage stochastic knapsack problem with discretely distributed weights
- Speed-robust scheduling: sand, bricks, and rocks
- On Approximation Algorithms for Two-Stage Scheduling Problems
- Stochastic makespan minimization in structured set systems (extended abstract)
- Stochastic and robust scheduling in the cloud
- Approximation Algorithms for 2-Stage Stochastic Optimization Problems
- scientific article; zbMATH DE number 6469210 (Why is no real title available?)
- On greedy approximation algorithms for a class of two-stage stochastic assignment problems
- Commitment under uncertainty: Two-stage stochastic matching problems
This page was built for publication: Approximation Algorithms for 2-Stage Stochastic Scheduling Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5429264)
