Improved algorithms for dynamic lot sizing problems with incremental discount

DOI10.1080/10556788.2017.1368508zbMath1407.90012OpenAlexW2751182137MaRDI QIDQ4646677

Guoqing Wang, Jie Fan

Publication date: 14 January 2019

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2017.1368508

zbMATH Keywords

dynamic programmingexact algorithmsdynamic lot sizinggeometric techniqueconcave piecewise linear cost

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Dynamic programming (90C39)

Cites Work

• A new dynamic programming algorithm for the single item capacitated dynamic lot size model
• A dynamic programming algorithm for dynamic lot size models with piecewise linear costs
• Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions
• Improved exact algorithms to economic lot-sizing with piecewise linear production costs
• A dynamic quantity discount lot size model with resales
• Facets and algorithms for capacitated lot sizing
• A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs
• Corrigendum to ``A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs
• Economic lot sizing: the capacity reservation model
• Polynomial cases of the economic lot sizing problem with cost discounts
• Dynamic Version of the Economic Lot Size Model
• An Algorithm for Single-Item Capacitated Economic Lot Sizing with Piecewise Linear Production Costs and General Holding Costs
• Lot Sizing with Piecewise Concave Production Costs
• Dynamic lot sizing with all‐units discount and resales
• Improved algorithms for a lot‐sizing problem with inventory bounds and backlogging
• Economic lot sizing with constant capacities and concave inventory costs
• The dynamic lot size model with quantity discount
• On the Effectiveness of Zero-Inventory-Ordering Policies for the Economic Lot-Sizing Model with a Class of Piecewise Linear Cost Structures
• An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity Constraints
• 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
• Bounded Production and Inventory Models with Piecewise Concave Costs
• A Deterministic Multi-Period Production Planning Model with Piecewise Concave Production and Holding-Backorder Costs
• Improved Algorithms for Economic Lot Size Problems
• The dynamic lot size model with quantity discount: Counterexamples and correction
• Dynamic Lot Sizing with Batch Ordering and Truckload Discounts
• Algorithms for Single-Item Lot-Sizing Problems with Constant Batch Size
• Minimum Concave Cost Flows in Certain Networks
• Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems

This page was built for publication: Improved algorithms for dynamic lot sizing problems with incremental discount