Scheduling under uncertainty: Optimizing against a randomizing adversary
From MaRDI portal
Recommendations
- On optimal scheduling under uncertainty
- Scheduling under uncertainty: Bounding the makespan distribution
- Scheduling with explorable uncertainty
- As soon as probable: optimal scheduling under stochastic uncertainty
- A theoretic and practical framework for scheduling in a stochastic environment
- Euro-Par 2004 Parallel Processing
- scientific article; zbMATH DE number 1539053
- Optimal stochastic scheduling
- Approximation algorithms for multiprocessor scheduling under uncertainty
Cited in
(16)- New strategies for stochastic resource-constrained project scheduling
- Maximizing the expected net present value of a project with phase-type distributed activity durations: an efficient globally optimal solution procedure
- On the fallacy of averages in project risk management
- Interval data minmax regret network optimization problems
- Minimizing the expected makespan of a project with stochastic activity durations under resource constraints
- Project planning with alternative technologies in uncertain environments
- Evolutionary multi-objective resource allocation and scheduling in the Chinese navigation satellite system project
- Project scheduling under competition
- scientific article; zbMATH DE number 5125607 (Why is no real title available?)
- Scheduling modular projects on a bottleneck resource
- scientific article; zbMATH DE number 2073567 (Why is no real title available?)
- Scheduling under uncertainty: Bounding the makespan distribution
- scientific article; zbMATH DE number 7339443 (Why is no real title available?)
- Euro-Par 2004 Parallel Processing
- Dynamic surgery management under uncertainty
- Making random choices invisible to the scheduler
This page was built for publication: Scheduling under uncertainty: Optimizing against a randomizing adversary
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2753722)
