Numerical evaluation of heuristics for the multi-item single-level capacitated lot-size problem

The problem considered is the determination of lot sizes for multiple products to be produced on a single production facility with limited capacity. Demand is assumed to be deterministic and time-varying and must be met without backordering. The objective is to minimize the sum of setup and inventory holding costs.

[1]  E. Silver,et al.  A heuristic solution procedure for the multi-item, single-level, limited capacity, lot-sizing problem , 1981 .

[3]  L. J. Thomas,et al.  Heuristics for multilevel lot-sizing with a bottleneck , 1986 .

[4]  N. Adam,et al.  The Dynamic Lot-Sizing Problem for Multiple Items Under Limited Capacity , 1981 .

[5]  Luk N. Van Wassenhove,et al.  Capacitated Lot Sizing for Injection Moulding: A Case Study , 1983 .

[6]  Ludo Gelders,et al.  Lot sizing under dynamic demand conditions: A review , 1984 .

[7]  M. Lambrecht,et al.  Heuristic Procedures for the Single Operation, Multi-Item Loading Problem , 1979 .

[8]  Performance of constrained multi-item inventory systems within a rolling horizon regime , 1987 .

[9]  Luk N. Van Wassenhove,et al.  Multi Item Single Level Capacitated Dynamic Lotsizing Heuristics: A Computational Comparison (Part I: Static Case) , 1986 .

[10]  Edward A. Silver,et al.  A heuristic algorithm for determining lot sizes of an item subject to regular and overtime production capacities , 1983 .

[11]  Hans-Otto Günther,et al.  The Design of an Hierarchical Model for Production Planning and Scheduling , 1986 .

[12]  Luk N. Van Wassenhove,et al.  A simple heuristic for the multi item single level capacitated lotsizing problem , 1986 .

[13]  Luk N. Van Wassenhove,et al.  Planning production in a bottleneck department , 1983 .

[14]  H. O. Gu¨nther.  Planning lot sizes and capacity requirements in a single stage production system , 1987 .

[15]  Anthony J. Zahorik,et al.  Network Programming Models for Production Scheduling in Multi-Stage, Multi-Item Capacitated Systems , 1984 .

[16]  James R. Evans.  An efficient implementation of the Wagner-Whitin algorithm for dynamic lot-sizing , 1985 .