Reformulations of the shortest route model for dynamic multi-item multi-level capacitated lotsizing

DOI10.1007/BF01545506zbMath0888.90051MaRDI QIDQ1374386

Hartmut Stadtler

Publication date: 4 December 1997

Published in: OR Spektrum (Search for Journal in Brave)

zbMATH Keywords

shortest route representation of the dynamic multi-item multi-level capacitated lotsizing problemtightest LP relaxation

Mathematics Subject Classification ID

Linear programming (90C05) Inventory, storage, reservoirs (90B05)

Related Items

Efficient reformulations for dynamic lot-sizing problems with product substitution, Dynamic capacitated lot-sizing problems: a classification and review of solution approaches, Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches, Predictive Search for Capacitated Multi-Item Lot Sizing Problems, LS-LIB: A Library of Tools for Solving Production Planning Problems, The one-warehouse multi-retailer problem: reformulation, classification, and computational results, Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times, A general quantity discount and supplier selection mixed integer programming model, Lot sizing and scheduling -- survey and extensions, Approximate extended formulations

Uses Software

• AMPL
• Mlclsp

Cites Work

• Multi-level multi-item lot size planning with limited resources and general manufacturing structure.
• Multilevel capacitated lotsizing complexity and LP-based heuristics
• Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing
• A heuristic for dynamic multi-item multi-level capacitated lotsizing for general product structures
• Lot sizing in capacitated production planning and control systems
• Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction
• Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
• Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
• A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
• A Heuristic for a Resource-capacitated Multi-stage Lot-sizing Problem with Lead Times