An efficient approach for solving the lot-sizing problem with time-varying storage capacities (Q2482746): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejor.2006.09.096
+Normal rank
@@ Property / OpenAlex ID @@
+W4242446953
@@ Property / OpenAlex ID: W4242446953 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Algorithms for Economic Lot Size Problems
+Normal rank
@@ Property / cites work @@
+A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
+Normal rank
@@ Property / cites work @@
+A new characterization for the dynamic lot size problem with bounded inventory
+Normal rank
@@ Property / cites work @@
+Bounded Production and Inventory Models with Piecewise Concave Costs
+Normal rank
@@ Property / cites work @@
+An \(O(T\log T)\) algorithm for the dynamic lot size problem with limited storage and linear costs
+Normal rank
@@ Property / cites work @@
+Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
+Normal rank
@@ Property / cites work @@
+Dynamic Version of the Economic Lot Size Model
@@ Property / cites work: Dynamic Version of the Economic Lot Size Model / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum Concave Cost Flows in Certain Networks
@@ Property / cites work: Minimum Concave Cost Flows in Certain Networks / rank @@
+Normal rank