1986 | OriginalPaper | Buchkapitel
A Branch and Bound Algorithm for the Multi Item Single Level Capacitated Dynamic Lotsizing Problem
verfasst von : Ludo F. Gelders, Johan Maes, Luk N. van Wassenhove
Erschienen in: Multi-Stage Production Planning and Inventory Control
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In this paper we present a branch and bound algorithm for the multi item capacitated lotsizing problem. The bounding procedure is based on a Lagrangean relaxation of the problem. The multipliers are updated using subgradient optimization.Although this algorithm can solve the problem to optimality, it is mainly used as a heuristic. Extensive computational results are reported for a large number of problems.