TECHNICAL NOTE—Solving Linear Cost Dynamic Lot-Sizing Problems in O(n log n) Time

DOI10.1287/OPRE.1070.0508MaRDI QIDQ3392169zbMATH OpenOpenAlexFDO

Authors Ravindra K. Ahuja, Dorit S. Hochbaum

Publication date 13 August 2009

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.1070.0508

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Inventory, storage, reservoirs (90B05) Deterministic scheduling theory in operations research (90B35)

Recommendations

• An \(O(T\log T)\) algorithm for the dynamic lot size problem with limited storage and linear costs
• A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
• An O(T³) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
• A minimum concave-cost dynamic network flow problem with an application to lot-sizing
• Economic lot sizing with constant capacities and concave inventory costs

Cited in

(17)

• The stochastic lot-sizing problem with quantity discounts
• An \(O(T\log T)\) algorithm for the dynamic lot size problem with limited storage and linear costs
• Efficient reformulations for dynamic lot-sizing problems with product substitution
• An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem
• Fast algorithms for convex cost flow problems on circles, lines, and trees
• Analysis of a dynamic lot-sizing problem with production capacity constraint
• Polynomial-time solvability of dynamic lot size problems
• scientific article; zbMATH DE number 4149861 (Why is no real title available?)
• A minimum concave-cost dynamic network flow problem with an application to lot-sizing
• A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
• Minimizing Separable Convex Objectives on Arbitrarily Directed Trees of Variable Upper Bound Constraints
• Dynamic lot sizing for multiple products with a new joint replenishment model
• The dynamic lot-sizing problem with variable unit costs
• A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints
• Stochastic lot-sizing problem with inventory-bounds and constant order-capacities
• Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in \(O(N \log N)\) time
• A robust lot sizing problem with ill-known demands

This page was built for publication: TECHNICAL NOTE—Solving Linear Cost Dynamic Lot-Sizing Problems in O(n log n) Time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3392169)