We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
The Capacitated Lot-Sizing Problem with Linked Lot Sizes.
- Authors
Suerie, Christopher; Stadtler, Hartmut
- Abstract
In this paper a new mixed integer programming (MIP) model formulation and its incorporation into a time-oriented decomposition heuristic for the capacitated lot-sizing problem with linked lot sizes (CLSPL) is proposed. The solution approach is based on an extended model formulation and valid inequalities to yield a tight formulation. Extensive computational tests prove the capability of this approach and show a superior solution quality with respect to other solution algorithms published so far.
- Subjects
INTEGER programming; ECONOMIC lot size; INVENTORY control; MATHEMATICAL programming; DYNAMIC programming; ALGORITHMS
- Publication
Management Science, 2003, Vol 49, Issue 8, p1039
- ISSN
0025-1909
- Publication type
Article
- DOI
10.1287/mnsc.49.8.1039.16406