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...

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...

We study the joint replenishment problem (JRP) for M items under deterministic demand, with a minimum order quantity constraint for each item in the replenishment order. We first study an iterative procedure that proves to be not efficient in this case. Further, we derive bounds on the basic...

We study the joint replenishment problem (JRP) for M items under deterministic demand, with a minimum order quantity constraint for each item in the replenishment order. We first study an iterative procedure that proves to be not efficient in this case. Further, we derive bounds on the basic...