Lot sizing and scheduling — Survey and extensions <s> qj(t'-I) = O, <s> Certain manufacturing situations involve a small number of items produced sequentially on the same facility with high changeover cost. Production schedules are characterized by long runs, and individual items are produced infrequently. At the same time, seasonal demand patterns require that the items be maintained in inventory in the right mix. This paper presents alternative formulations of this problem. It uses a Lagrangean relaxation approach to decouple the problem and provide lower bounds used in a branch and bound algorithm. Some experimental computations on small problems are reported. <s> BIB001 </s> Lot sizing and scheduling — Survey and extensions <s> qj(t'-I) = O, <s> We consider two approximation formulations for the single-product capacitated lot size problem. One formulation restricts the number of production policies and the other rounds demands up to multiples of a constant. After briefly reviewing the literature within a new framework, we discuss the relations between these approximation formulations. Next, we provide relative error bounds and algorithms for solving the approximation problems. We demonstrate that these approximation formulations require a significantly smaller number of calculations than the original formulation, and that the relative error bounds are satisfactory for practical purposes. <s> BIB002
as it does in the DLSE Compared to the DLSP, the CSLP has attracted only little research interest. It is dealt with in BIB002 ,  and BIB001 .