Skip to main content

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

Aktivieren Sie unsere intelligente Suche um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Metadaten
Titel
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
Copyright-Jahr
1986
Verlag
Springer Berlin Heidelberg
DOI
https://doi.org/10.1007/978-3-642-51693-1_5