01366naa a2200253 a 450000100080000000500110000800800410001910000230006024501030008326000090018652006010019565000240079665000150082065300270083565300390086265300240090165300250092565300150095065300260096565300150099165300190100670000210102577300660104610036582019-02-15       1994    bl uuuu     u00u1 u    #d1 aSOUZA, K. X. S. de  aMulti-item capacitated lot-sizing by a Cross decomposition based algorithm.h[electronic resource]  c1994  aMulti-item capacitated lot-sizing involves the determination of production quantities in different periods in the presence of resource constraints. The model presented in this paper includes a setup time for the production of a lot of an item. The production of items in a given period is constrained by a limited regular time and a limited overtime. Moreover, the production level of any item in a given period is also limited. This problem is tackled by a Cross decomposition based algorithm which can provide an optimal solution, or a near optimal solution if computational time is restricted.  aoperations research  aProdução  aCapacitated lot-sizing  aDeterminação de tamanho de lotes  aInteger programming  aPesquisa operacional  aProduction  aProgramação inteira  aSetup time  aTempo de setup1 aARMENTANO, V. A.  tAnnals of Operations Researchgv. 50, n. 1, p. 557-574, 1994.