🧪 Test?View on arXiv
Discrete-Time MDP Modeling for Multi-Item Capacitated Lot Sizing with Stochastic Demand Timing
Author1, Author2, Author3, Author4, Author5
MDPlot-sizingstochastic modelinggenetic algorithms
2609.00004
Builder Relevance
2h ago70%
Abstract
This paper presents a model for a multi-item capacitated lot-sizing problem with stochastic demand timing, highlighting the impact of demand-arrival periods on production and allocation decisions.
Reality Card
Core Claim
The proposed genetic algorithm effectively approximates the optimal solution for the stochastic timing problem with an average optimality gap of about 3.44%.
Method / Result
The genetic algorithm achieves an average optimization speedup of 6.89 at the 95% confidence level.
Limitations
The computational complexity increases significantly with stochastic timing, which may hinder reproducibility on standard hardware.
Paper to code
Verified implementation resources so builders can test the paper’s claims instead of stopping at the abstract.
No verified implementation link has been attached yet. AIBuzzHub will keep this panel separate from unverified search results.