Pages that link to "Item:Q3990573"
From MaRDI portal
The following pages link to Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case (Q3990573):
Displaying 48 items.
- Economic lot sizing: the capacity reservation model (Q2450755) (← links)
- Economic lot sizing problem with inventory bounds (Q2456418) (← links)
- Lot-sizing with non-stationary cumulative capacities (Q2457275) (← links)
- Dynamic lot-sizing problem with demand time windows and container-based transportation cost (Q2465565) (← links)
- Reformulation by discretization: application to economic lot sizing (Q2465954) (← links)
- Lot sizing with inventory gains (Q2467450) (← links)
- An efficient approach for solving the lot-sizing problem with time-varying storage capacities (Q2482746) (← links)
- A comparison of methods for lot-sizing in a rolling horizon environment (Q2488200) (← links)
- Dynamic lot-sizing model with demand time windows and speculative cost structure (Q2494817) (← links)
- An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem (Q2496059) (← links)
- Cross-facility management of production and transportation planning problem (Q2499157) (← links)
- Polynomial cases of the economic lot sizing problem with cost discounts (Q2514883) (← links)
- Single item lot sizing problems (Q2566041) (← links)
- A polynomial time algorithm for a deterministic joint pricing and inventory model (Q2572250) (← links)
- A two-echelon inventory optimization model with demand time window considerations (Q2574100) (← links)
- A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem (Q2583144) (← links)
- Minimizing setups and waste when printing labels of consumer goods (Q2676270) (← links)
- On the Wagner-Whitin lot-sizing polyhedron. (Q2757684) (← links)
- Fast algorithms for convex cost flow problems on circles, lines, and trees (Q2811315) (← links)
- On the computational complexity of minimum-concave-cost flow in a two-dimensional grid (Q2828332) (← links)
- Economic production lot sizing model with stochastic demand (Q2875631) (← links)
- A fast Lagrangian heuristic for large-scale capacitated lot-size problems with restricted cost structures (Q2907902) (← links)
- DECISION ANALYSIS FOR SUPPLIER IN TWO-ECHELON SUPPLY CHAIN WITH DISCRETE DEMAND VIA DYNAMIC GAME (Q2931719) (← links)
- Just-in-Time Planning and Lot-Sizing (Q2958674) (← links)
- Integrating facility location and production planning decisions (Q3057133) (← links)
- Grouping in decomposition method for multi-item capacitated lot-sizing problem with immediate lost sales and joint and item-dependent setup cost (Q3082694) (← links)
- Dynamic re-order point inventory control with lead-time uncertainty: analysis and empirical investigation (Q3183775) (← links)
- Polynomial-Time Solvability of Dynamic Lot Size Problems (Q3188765) (← links)
- A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging (Q3503865) (← links)
- Competition under time‐varying demands and dynamic lot sizing costs (Q3621912) (← links)
- Scheduling multiple products on parallel machines with setup costs (Q3627937) (← 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)
- Minimizing Separable Convex Objectives on Arbitrarily Directed Trees of Variable Upper Bound Constraints (Q3986754) (← links)
- Improved Algorithms for Economic Lot Size Problems (Q4202457) (← links)
- Time-partitioning heuristics: Application to one warehouse, multiitem, multiretailer lot-sizing problems (Q4266754) (← links)
- ارائه یک روش برنامه ریزی پویا کارا جهت بهینه سازی مسئله اندازه سفارش با محدودیت ظرفیت (Q4615735) (← links)
- Improved algorithms for dynamic lot sizing problems with incremental discount (Q4646677) (← links)
- A branch and bound method for stochastic integer problems under probabilistic constraints (Q4709729) (← links)
- Combining Polyhedral Approaches and Stochastic Dual Dynamic Integer Programming for Solving the Uncapacitated Lot-Sizing Problem Under Uncertainty (Q5086004) (← links)
- Multiechelon Lot Sizing: New Complexities and Inequalities (Q5131474) (← links)
- Multi-item capacitated lot-sizing problems with setup times and pricing decisions (Q5189247) (← links)
- Decentralized supply chain coordination through auction markets: dynamic lot-sizing in distribution networks (Q5428730) (← links)
- Disassembly scheduling: literature review and future research directions (Q5444546) (← links)
- Discrepancies in solutions between traditional and net present value formulations of finite horizon, discrete-time economic lot size problems (Q5451188) (← links)
- Lot sizing with bounded inventory and lost sales (Q5451189) (← links)
- A cash‐constrained dynamic lot‐sizing problem with loss of goodwill and credit‐based loan (Q6092619) (← links)
- New construction heuristic for capacitated lot sizing problems (Q6096617) (← links)
- Economic lot sizing problem with tank scheduling (Q6167403) (← links)
