Stochastic lot-sizing and scheduling for quality-differentiated disassembly

We address a multi-period stochastic disassembly scheduling problem using a two-stage program where first-stage scheduling is coupled with a complex recourse stage governed by a shared procurement cost. To solve this NP-hard problem, we propose a decomposition-inspired Simulated Annealing (SA) heuristic that uses an embedded MIP solver to evaluate the recourse. We benchmark the SA against a full extensive-form MIP and a deterministic model to analyze the trade-offs between heuristic performance, solution exactness, and the value of stochastic modeling.