this paper proposes a new mixed integer programming model for multi-item capacitated lot-sizing problem with setup times, safety stock and demand shortages in closed-loop supply chains. the returned products from customers can either be disposed or be remanufactured to be sold as new ones again. due to the complexity of problem, three meta-heuristics algorithms named simulated annealing (sa) al...

We study the following lot-sizing models that recently appeared in the literature: a lotsizing model with a remanufacturing option, a lot-sizing model with production time windows, and a lot-sizing model with cumulative capacities. We show the equivalence of these models with a classical model: the lot-sizing model with inventory bounds.

[1] corresponding author e-mail: [email protected]   [1] corresponding author e-mail: [email protected]   lot-sizing problems (lsps) belong to the class of production planning problems in which the availability quantities of the production plan are always considered as a decision variable. this paper aims at developing a new mathematical model for the multi-level capacitated lsp w...

The purpose of this research is to propose several optimization methods for the stochastic multi-period disassembly lot-sizing problem. case one type end-of-life product and a two-level system studied. lead times are discrete random variables with known bounded probability distribution. objective optimize expected value total cost, which sum setup overload inventory holding cost backlogging cos...

A heuristic approach is developed for supply chain planning modeled as multi-item multi-level capacitated lot sizing problems. The heuristic combines Lagrangian relaxation (LR) with local search. Different from existing LR approaches that relax capacity constraints and/or inventory balance constraints, our approach only relaxes the technical constraints that each 0-1 setup variable must take va...