Khouja and Park (Omega 31, 539-545, 2003) analyze the problem of optimizing the lot size under continuous price decrease. They show that the classic EOQ formula can lead to far from optimal solutions and develop an alternative lot size formula using the software package Mathematica. This formula...

One of the basic assumptions of the classical dynamic lot-sizing model is that the aggregate demand of a given period must be satisfied in that period. Under this assumption, if backlogging is not allowed then the demand of a given period cannot be delivered earlier or later than the period. If...

This paper considers a dynamic lot-sizing problem with storage capacity limitation in which backlogging is allowed. For general concave production and inventory costs, we present an O(T2) dynamic programming algorithm where ï”is the length of the planning horizon. Furthermore, for...

We study the following lot-sizing models that recently appeared in the literature: a lot-sizing 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:...

In this paper we investigate the complexity of the economic lot-sizing problem with remanufacturing (ELSR) options. Whereas in the classical economic lot-sizing problem demand can only be satisfied by production, in the ELSR problem demand can also be satisfied by remanufacturing returned items....