Pages that link to "Item:Q1318270"
From MaRDI portal
The following pages link to A new dynamic programming algorithm for the single item capacitated dynamic lot size model (Q1318270):
Displaying 33 items.
- Dynamic programming approximation algorithms for the capacitated lot-sizing problem (Q288224) (← links)
- Dual-mode production planning for manufacturing with emission constraints (Q322630) (← links)
- A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints (Q583078) (← links)
- Capacitated dynamic lot-sizing problem with delivery/production time windows (Q613340) (← links)
- Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in \(O(N \log N)\) time (Q613509) (← links)
- Inventory replenishment model: lot sizing versus just-in-time delivery. (Q703285) (← links)
- Analysis of bounds for a capacitated single-item lot-sizing problem (Q858280) (← links)
- A primal-dual algorithm for the economic lot-sizing problem with multi-mode replenishment (Q1011268) (← links)
- Capacitated dynamic lot sizing problems in closed-loop supply chain (Q1042061) (← links)
- An efficient algorithm for the capacitated single item dynamic lot size problem (Q1262197) (← links)
- A dynamic programming algorithm for dynamic lot size models with piecewise linear costs (Q1327429) (← links)
- An effective algorithm for the capacitated single item lot size problem (Q1331619) (← links)
- A joint chance-constrained programming approach for the single-item capacitated lot-sizing problem with stochastic demand (Q1639278) (← links)
- Single-item dynamic lot-sizing problems: an updated survey (Q1694825) (← links)
- Improved exact algorithms to economic lot-sizing with piecewise linear production costs (Q1752258) (← links)
- A new characterization for the dynamic lot size problem with bounded inventory (Q1869910) (← links)
- Production lot-sizing with dynamic capacity adjustment (Q1991128) (← links)
- A Lagrangian heuristic for capacitated single item lot sizing problems (Q2351162) (← 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)
- Single item lot sizing problems (Q2566041) (← links)
- A two-echelon inventory optimization model with demand time window considerations (Q2574100) (← links)
- Dynamic version of the economic lot size model (Q2763613) (← 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)
- A Forward Algorithm for the Capacitated Lot Size Model with Stockouts (Q3351120) (← links)
- Capacitated production planning with outsourcing in an OKP company (Q3541177) (← links)
- A Dynamic Lot-Size Model with Make-or-Buy Decisions (Q3818781) (← links)
- Strong turnpike policies in the single-item capacitated lot-sizing problem with periodical dynamic parameter (Q4372781) (← links)
- ارائه یک روش برنامه ریزی پویا کارا جهت بهینه سازی مسئله اندازه سفارش با محدودیت ظرفیت (Q4615735) (← links)
- Improved algorithms for dynamic lot sizing problems with incremental discount (Q4646677) (← links)
- Algorithm for turnpike policies in the dynamic lot size model (Q4895384) (← links)
- Decentralized supply chain coordination through auction markets: dynamic lot-sizing in distribution networks (Q5428730) (← links)
- Modèle linéaire mixte et heuristique pour un réseau de distribution à deux échelons pour des produits périssables (Q6160419) (← links)
