A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing

DOI10.1007/s10472-013-9339-9zbMath1291.90323OpenAlexW2094587300MaRDI QIDQ2248555

Marco Caserta, Stefan Voß

Publication date: 26 June 2014

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-013-9339-9

zbMATH Keywords

lot sizingperishabilitycorridor methodDantzig-Wolfe algorithmmath-heuristic (matheuristic)

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Inventory, storage, reservoirs (90B05)

Related Items

Integrating deterioration and lifetime constraints in production and supply chain planning: a survey, A dynamic programming-based matheuristic for the dynamic berth allocation problem, Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing, Parameter tuning for local-search-based matheuristic methods, A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing, A matheuristic approach for solving the 2-connected dominating set problem

Uses Software

• bc-prod

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
• A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times
• The Steiner tree problem with hop constraints
• A cutting plane approach to capacitated lot-sizing with start-up costs
• Polyhedra for lot-sizing with Wagner-Whitin costs
• A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing
• Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company
• A generic view of Dantzig--Wolfe decomposition in mixed integer programming
• Dynamic Version of the Economic Lot Size Model
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
• Decomposition Principle for Linear Programs
• A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
• Matheuristics
• Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
• Send-and-Split Method for Minimum-Concave-Cost Network Flows
• Perishable Inventory Theory: A Review
• Modeling industrial lot sizing problems: a review