A simple heuristic for the multi-item single level capacitated lotsizing problem
A heuristic algorithm for the solution of the finite horizon multi-item inventory problem is proposed in this paper. Demands are known deterministically and are to be satisfied without backlogging while the order quantities in each period are constrained by a single capacity constraint. The algorithm is claimed to perform better than other existing algorithms with respect to both the computation time and the solution obtained.
scientific article; zbMATH DE number 3961308