Proactive Algorithms for Job Shop Scheduling with Probabilistic Durations
J. C. Beck, N. Wilson

TL;DR
This paper introduces proactive algorithms for job shop scheduling with uncertain durations modeled as random variables, combining Monte Carlo simulation with deterministic algorithms to improve scalability and solution quality under uncertainty.
Contribution
It develops a theoretical framework and novel algorithms that integrate Monte Carlo simulation with deterministic scheduling to handle probabilistic durations effectively.
Findings
Combination of deterministic solutions and Monte Carlo simulation scales well with problem size.
The quality of deterministic solutions correlates with probabilistic solution quality.
Proposed algorithms outperform traditional methods in uncertain scheduling scenarios.
Abstract
Most classical scheduling formulations assume a fixed and known duration for each activity. In this paper, we weaken this assumption, requiring instead that each duration can be represented by an independent random variable with a known mean and variance. The best solutions are ones which have a high probability of achieving a good makespan. We first create a theoretical framework, formally showing how Monte Carlo simulation can be combined with deterministic scheduling algorithms to solve this problem. We propose an associated deterministic scheduling problem whose solution is proved, under certain conditions, to be a lower bound for the probabilistic problem. We then propose and investigate a number of techniques for solving such problems based on combinations of Monte Carlo simulation, solutions to the associated deterministic problem, and either constraint programming or tabu…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
