Research map / Probabilistic and scientific modeling / Uncertainty and Gaussian processes
A Proactive Sampling Approach to Project Scheduling under Uncertainty
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| replace local-search FLPV with SORU-H summary-sample MIP | SORU-H · J10 | average alpha-robust makespan: 44.21 -> 40.43 | Helped |
| replace local-search FLPV with SORU-H summary-sample MIP | SORU-H · J30 | average alpha-robust makespan: 79.09 -> 73.99 | Helped |
| replace full-sample SAA MIP (SORU) with single percentile summary sample (SORU-H) (ablation) | SORU · J10 | % of instances with lower makespan (both feasible): 11.48% -> 37.04% | Helped |
| replace full-sample SAA MIP (SORU) with single percentile summary sample (SORU-H) (ablation) | SORU · J10 | feasible-only instances: 5.93% vs 0.37% | Hurt |
| use gamma = alpha - 0.1 instead of gamma = alpha or 0.15 (ablation) | SORU-H · representative J10 instances, alpha=0.2 | probability of failure | Helped |
| increase number of samples Q from 25 to 35 (ablation) | SORU-H · representative instances | probability of failure | Helped |
| increase number of samples Q beyond 35 up to 60 (ablation) | SORU-H · representative instances | probability of failure | No clear effect |
| use SORU full MIP vs FLPV | SORU · J10 | % of instances with lower makespan when both feasible: 28.14% FLPV lower vs 2.96% SORU lower | Hurt |
Closest papers by meaning
- Proactive and Reactive Constraint Programming for Stochastic Project Scheduling with Maximal Time-Lags (AAAI 2025 · similarity 0.86)
- New Sample Complexity Bounds for Sample Average Approximation in Heavy-Tailed Stochastic Programming (ICML 2024 · similarity 0.82)
- Don't Restart, Just Reuse: Reoptimizing MILPs with Dynamic Parameters (ICML 2025 · similarity 0.81)
- Differentiable Combinatorial Scheduling at Scale (ICML 2024 · similarity 0.81)
- On the Complexity of Discounted Robust MDPs with $L_p$ Uncertainty Sets (NeurIPS 2026 · similarity 0.81)
- Discovering Options That Minimize Average Planning Time (AAAI 2025 · similarity 0.80)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.