A primal-dual algorithm for the economic lot-sizing problem with multi-mode replenishment

DOI10.1016/j.ejor.2008.04.043zbMath1157.90309OpenAlexW2009562333MaRDI QIDQ1011268

Sandra Duni Ekşioğlu

Publication date: 8 April 2009

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2008.04.043

zbMATH Keywords

inventorynetwork flowsprimal-dual algorithmeconomic lot-sizingmulti-setups costs

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic network models in operations research (90B10) Inventory, storage, reservoirs (90B05)

Related Items

Optimal solutions for the economic lot-sizing problem with multiple suppliers and cost structures, Transportation mode selection in inventory models: a literature review

Uses Software

• LOTSIZELIB

Cites Work

• Unnamed Item
• Unnamed Item
• A new dynamic programming algorithm for the single item capacitated dynamic lot size model
• Progress with single-item lot-sizing
• Cross-facility management of production and transportation planning problem
• Dynamic Version of the Economic Lot Size Model
• Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs
• bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
• Distribution Strategies that Minimize Transportation and Inventory Costs
• Strong Formulations for Multi-Item Capacitated Lot Sizing
• Analysis of a flow problem with fixed charges
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity Constraints
• Computational Complexity of the Capacitated Lot Size Problem
• A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
• Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
• Improved Algorithms for Economic Lot Size Problems
• Manufacturing Planning Over Alternative Facilities: Modeling, Analysis and Algorithms
• Deterministic Production Planning with Concave Costs and Capacity Constraints
• Minimum Concave Cost Flows in Certain Networks