Valid inequalities, preprocessing, and an effective heuristic for the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure

DOI10.1016/j.ejor.2021.03.029zbMath1490.90017arXiv2010.01306OpenAlexW3138187653MaRDI QIDQ2242374

Rafael A. Melo, Jesus Ossian Cunha

Publication date: 9 November 2021

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2010.01306

zbMATH Keywords

heuristicsmixed integer programmingsupply chain managementpreprocessingmulti-level lot-sizing

Mathematics Subject Classification ID

Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Inventory, storage, reservoirs (90B05)

Cites Work

• Unnamed Item
• Unnamed Item
• On reformulations for the one-warehouse multi-retailer problem
• The production routing problem: a review of formulations and solution algorithms
• A solution approach to the inventory routing problem in a three-level distribution system
• Uncapacitated two-level lot-sizing
• Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
• The two-echelon multi-depot inventory-routing problem
• MIP formulations and heuristics for two-level production-transportation problems
• The one-warehouse multi-retailer problem: reformulation, classification, and computational results
• Randomized multi-level lot-sizing heuristics for general product structures.
• A computational analysis of lower bounds for big bucket production planning problems
• An optimal solution to a three echelon supply chain network with multi-product and multi-period
• A comparison of formulations for a three-level lot sizing and replenishment problem with a distribution structure
• Approximate extended formulations
• Dynamic Version of the Economic Lot Size Model
• A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands
• Uncapacitated lot-sizing: The convex hull of solutions
• Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes
• Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
• An integrated approach for production and distribution planning in supply chain management
• Production Planning by Mixed Integer Programming

This page was built for publication: Valid inequalities, preprocessing, and an effective heuristic for the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure