A simple heuristic for the multi-item single level capacitated lotsizing problem
type: Item
instance of: scholarly article
title: A simple heuristic for the multi-item single level capacitated lotsizing problem
zbMATH Open document ID: 0596.90029
DOI: 10.1016/0167-6377(86)90027-1
author: Johan Maes
author: Luk N. Van Wassenhove
published in: Operations Research Letters
publication date: 1986-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 3961308
zbMATH Keywords: single level capacitated lotsizing
zbMATH Keywords: production smoothing
zbMATH Keywords: heuristic algorithm
zbMATH Keywords: finite horizon multi-item inventory
MaRDI profile type: Publication
full work available at URL: 0167-6377(86)90027-1
OpenAlex ID: W2075040992
cites work: Strong Formulations for Multi-Item Capacitated Lot Sizing
cites work: Deterministic Production Planning: Algorithms and Complexity
description: scientific article; zbMATH DE number 3961308