Papers › Rolling horizon policies for multi-stage stochastic assemble-to-order problems
Rolling horizon policies for multi-stage stochastic assemble-to-order problems
Daniele Giovanni Gioia, Edoardo Fadda, Paolo Brandimarte
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Assemble-to-order approaches deal with randomness in demand for end items by producing components under uncertainty, but assembling them only after demand is observed. Such planning problems can be tackled by stochastic programming, but true multistage models are computationally challenging and only a few studies apply them to production planning. Solutions based on two-stage models are often short-sighted and unable to effectively deal with non-stationary demand. A further complication may be the scarcity of available data, especially in the case of correlated and seasonal demand. In this paper, we compare different scenario tree structures. In particular, we enrich a two-stage formulation by introducing a piecewise linear approximation of the value of the terminal inventory, to mitigate the two-stage myopic behavior. We compare the out-of-sample performance of the resulting models by rolling horizon simulations, within a data-driven setting, characterized by seasonality, bimodality, and correlations in the distribution of end item demand. Computational experiments suggest the potential benefit of adding a terminal value function and illustrate interesting patterns arising from demand correlations and the level of available capacity. The proposed approach can provide support to typical MRP/ERP systems, when a two-level approach is pursued, based on master production and final assembly scheduling.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections