Approximation Algorithms for 2-Stage Stochastic Scheduling Problems

DOI10.1007/978-3-540-72792-7_12zbMath1136.90358OpenAlexW1565242130MaRDI QIDQ5429264

Mauro Sozio, David B. Shmoys

Publication date: 29 November 2007

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72792-7_12

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (6)

Fast primal-dual distributed algorithms for scheduling and matching problems ⋮ Speed-robust scheduling: sand, bricks, and rocks ⋮ Approximability of the two-stage stochastic knapsack problem with discretely distributed weights ⋮ Commitment under uncertainty: Two-stage stochastic matching problems ⋮ A novel parallel quantum genetic algorithm for stochastic job shop scheduling ⋮ Speed-robust scheduling. Sand, bricks, and rocks

This page was built for publication: Approximation Algorithms for 2-Stage Stochastic Scheduling Problems