In this paper the authors study a deterministic production system model subjected to external deterministic demands. They consider a family of N items produced in the system and suppose that demands are specified for each item and each period of a given horizon of T periods. If in a given period an order is placed for some or all of the items, setup costs are incurred. The aggregate order size is constrained by capacity limit. In this context, their objective is to find a lot-sizing strategy that satisfies the demands for all items over the entire horizon without backlogging and that minimizes the sum of inventory-carrying costs, fixed-order costs and variable-order costs. Supposing that the model is characterized by the fact that the setup cost for an order in any given period only depends on the period index, but not on the composition of the order, the authors develop a new class of progressive interval heuristics. This technique permits them to identify implementations that are simultaneously asymptotically optimal as well as of very reasonable polynomial complexity. Leonardo Pasini
Recensione dell'articolo: (Federgruen, Awi; Meissner, Joern; Tzur, Michail - "Progressive interval heuristics for multi-item capacitated lot-sizing problems" - Oper.Res. 55 (2007), no.3, 490–502.)
PASINI, Leonardo
2008-01-01
Abstract
In this paper the authors study a deterministic production system model subjected to external deterministic demands. They consider a family of N items produced in the system and suppose that demands are specified for each item and each period of a given horizon of T periods. If in a given period an order is placed for some or all of the items, setup costs are incurred. The aggregate order size is constrained by capacity limit. In this context, their objective is to find a lot-sizing strategy that satisfies the demands for all items over the entire horizon without backlogging and that minimizes the sum of inventory-carrying costs, fixed-order costs and variable-order costs. Supposing that the model is characterized by the fact that the setup cost for an order in any given period only depends on the period index, but not on the composition of the order, the authors develop a new class of progressive interval heuristics. This technique permits them to identify implementations that are simultaneously asymptotically optimal as well as of very reasonable polynomial complexity. Leonardo PasiniI documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
