A General Lotsizing and Scheduling Problem with Stochastic Product Returns

We consider a multi-product capacitated lotsizing and scheduling problem with sequence-dependent setups and stochastic product returns. The returned products accumulate in an input inventory and can be sold as new items after a remanufacturing process. The deterministic
demand of end items can also be satisfied through a manufacturing process that is fed by an unlimited source of raw materials. An approximate dynamic algorithm is developed to solve both single-item and multi-items cases.