A Greedy Algorithm for Capacitated Lot-Sizing Problems
From MaRDI portal
Publication:4430673
DOI10.1080/0233193031000079801zbMATH Open1047.90034OpenAlexW1971764678MaRDI QIDQ4430673FDOQ4430673
Authors: Eberhard Girlich, Michael Höding, Alexander Zaporozhets, Sergei Chubanov 
Publication date: 12 October 2003
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/0233193031000079801
Recommendations
- An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem
- An effective algorithm for the capacitated single item lot size problem
- Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost
- An efficient algorithm for the capacitated single item dynamic lot size problem
- An \(O(T\log T)\) algorithm for the dynamic lot size problem with limited storage and linear costs
Cites Work
- Submodular functions and optimization
- A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
- Computational Complexity of the Capacitated Lot Size Problem
- Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
- An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
- Title not available (Why is that?)
Cited In (5)
- A linear-time algorithm for finding optimal vehicle refueling policies
- An O(T2) Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem
- An efficient algorithm for the 2-level capacitated lot-sizing problem with identical capacities at both levels
- An \(O(T^{3})\) algorithm for the capacitated lot sizing problem with minimum order quantities
- An exact algorithm for the capacitated total quantity discount problem
This page was built for publication: A Greedy Algorithm for Capacitated Lot-Sizing Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4430673)
