Discrete-Time MDP Modeling for Multi-Item Capacitated Lot Sizing with Stochastic Demand Timing
arXiv cs.AIen
arXiv:2609.00004v1 Announce Type: new Abstract: This paper studies a finite-horizon multi-item capacitated lot-sizing problem in which demand quantities are deterministic, while demand-arrival periods are stochastic. Each demand occurs once within a known time window and must be satisfied no later than its deadline. The proposed model makes production and allocation decisions at the demand level, allowing it to represent capacity competition, demand-specific backlog, and allocation-dependent inventory dynamics. The stochastic problem is formulated as a discrete-time Markov decision process (DTMDP), including the state space, feasible actions, transition kernel, and one-period cost function.
This is a short summary published by AI Global Wire. The full article is owned and hosted by arXiv cs.AI — open it there to read it in full.
Read the full story at arXiv cs.AI- Forskning
Related AI news
- UI-Venus-2 Technical ReportarXiv cs.AI · September 2, 2026
- When Prediction Error Is Not Enough: Evaluating Nuisance-Function Prediction for Causal EstimationarXiv cs.AI · September 2, 2026
- MiNER: Fine-Tuned Biomedical Natural Language Processing for Malaria Disease Entity Recognition in Clinical TextsarXiv cs.AI · September 2, 2026
- Asymmetries in Spontaneous and Instructed DeceptionarXiv cs.AI · September 2, 2026
- ReDeck: Step-Level Render-Grounded Refinement for Document-to-Slide GenerationarXiv cs.AI · September 2, 2026
- ConvDeck: Conversational Paper-to-Slide Generation via Stage-Specific User FeedbackarXiv cs.AI · September 2, 2026