Pages that link to "Item:Q1206386"
From MaRDI portal
The following pages link to An efficient algorithm for the dynamic economic lot size problem (Q1206386):
Displaying 30 items.
- Lot-trees: A unifying view and efficient implementation of forward procedures for the dynamic lot-size problem (Q910333) (← links)
- An optimal solution for the stochastic version of the Wagner-Whitin dynamic lot-size model (Q1026769) (← links)
- Dynamische Bestellmengen- und Losgrößenplanung. Verfahrensübersicht und Vergleich (Q1093515) (← links)
- A dual algorithm for the economic lot-sizing problem (Q1175307) (← links)
- An algorithm based on a new sufficient condition of optimality in dynamic lot size model (Q1198322) (← links)
- Efficient post-optimization analysis procedure for the dynamic lot-sizing problem (Q1261343) (← links)
- An efficient algorithm for the capacitated single item dynamic lot size problem (Q1262197) (← links)
- Sensitivity analysis of the economic lot-sizing problem (Q1309816) (← links)
- Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions (Q1331605) (← links)
- Dynamic lot sizing with random demand and non-stationary costs (Q1362520) (← links)
- Extensions of simple eyeballing dynamic lot sizing heuristics. (Q1406650) (← links)
- A novel decomposition approach for on-line lot-sizing. (Q1582194) (← links)
- An algorithm for general infinite horizon lot sizing with deterministic demand (Q1704039) (← links)
- A hybrid polynomial-time algorithm for the dynamic quantity discount lot size model with resale (Q1762169) (← links)
- Dual dynamic programming for linear production/inventory systems (Q1813749) (← links)
- A new characterization for the dynamic lot size problem with bounded inventory (Q1869910) (← links)
- Efficient reformulations for dynamic lot-sizing problems with product substitution (Q2379664) (← links)
- Dynamic version of the economic lot size model (Q2763613) (← links)
- A polynomial-time algorithm for the economic lot-size problem with multiple suppliers and multiple retailers (Q2917961) (← links)
- Optimal Algorithms for the Economic Lot-Sizing Problem with Multi-supplier (Q3578357) (← links)
- A Dynamic Lot-Size Model with Make-or-Buy Decisions (Q3818781) (← links)
- Computing Optimal Lot Sizes in the Economic Lot Scheduling Problem (Q3981509) (← links)
- A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time (Q3985143) (← links)
- Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case (Q3990573) (← links)
- Improved Algorithms for Economic Lot Size Problems (Q4202457) (← links)
- An improved algorithm for the dynamic lot-sizing problem with learning effect in setups (Q4287983) (← links)
- An efficient integer programming model of the dynamic lot-sizing problem (Q4298947) (← links)
- Note: Dynamic lot sizing for a finite rate input process (Q4368527) (← links)
- The dynamic lot-sizing problem with variable unit costs (Q4851980) (← links)
- The dynamic lot-sizing model with backlogging: A simple \(O(n\log n)\) algorithm and minimal forecast horizon procedure (Q5287175) (← links)
