This paper continues the analysis of a special uncapacitated single item lot sizing problem where a minimum order quantity restriction, instead of the setup cost, guarantees a certain level of production lots. A detailed analysis of the model and an investigation of the particularities of the...

This paper explores a single-item capacitated lot sizing problem with minimum order quantity, which plays the role of minor set-up cost. We work out the necessary and suffcient solvability conditions and apply the general dynamic programming technique to develop an O(T³) exact algorithm that is...

An economic lot size problem is studied in which a single vendor supplies a single purchaser with a homogeneous product and takes a certain fraction of the used items back for remanufacturing, in exchange for a deposit transferred to the purchaser. For the given demand, productivity, fixed...

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

We consider a model for a serial supply chain in which production, inventory, and transportation decisions are integrated, in the presence of production capacities and for different transportation cost functions. The model we study is a generalization of the traditional single-item economic...

In a recent paper, Fisher et al. (2001) present a method tomitigate end-effects in lot sizing by including a valuation term for end-of-horizon inventory in the objective function of the short-horizon model. Computational tests show that the proposed method outperforms the Wagner-Whitin algorithm...