Pages that link to "Item:Q3821896"
From MaRDI portal
The following pages link to An <i>O</i>(<i>T</i><sup>2</sup>) Algorithm for the <i>NI</i>/<i>G</i>/<i>NI</i>/<i>ND</i> Capacitated Lot Size Problem (Q3821896):
Displayed 31 items.
- Dual-mode production planning for manufacturing with emission constraints (Q322630) (← links)
- An \(O(T^{3})\) algorithm for the capacitated lot sizing problem with minimum order quantities (Q418062) (← links)
- A solution approach to the inventory routing problem in a three-level distribution system (Q541738) (← 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)
- Single item lot-sizing with non-decreasing capacities (Q847825) (← links)
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (Q857326) (← links)
- An algorithm for single-item economic lot-sizing problem with general inventory cost, non-decreasing capacity, and non-increasing setup and production cost (Q943784) (← links)
- A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure (Q1042524) (← links)
- An efficient algorithm for the capacitated single item dynamic lot size problem (Q1262197) (← links)
- A new dynamic programming algorithm for the single item capacitated dynamic lot size model (Q1318270) (← 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)
- The impact of forecasting model selection on the value of information sharing in a supply chain (Q1848368) (← links)
- A new characterization for the dynamic lot size problem with bounded inventory (Q1869910) (← links)
- Subcontracting and lot-sizing with constant capacities (Q2133416) (← links)
- Decision horizons for the capacitated lot size model with inventory bounds and stockouts (Q2368105) (← links)
- Economic lot sizing: the capacity reservation model (Q2450755) (← links)
- Single item lot-sizing problem for a warm/cold process with immediate lost sales (Q2467270) (← links)
- A linear-time algorithm for finding optimal vehicle refueling policies (Q2467464) (← links)
- A single-item economic lot-sizing problem with a non-uniform resource: Approximation (Q2482766) (← links)
- An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem (Q2496059) (← links)
- Single item lot sizing problems (Q2566041) (← links)
- A two-echelon inventory optimization model with demand time window considerations (Q2574100) (← links)
- Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount (Q2669493) (← 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)
- Capacitated production planning with outsourcing in an OKP company (Q3541177) (← links)
- Improving the supply chain performance: Use of forecasting models versus early order commitments (Q4443307) (← links)
- Forecasting errors and the value of information sharing in a supply chain (Q4674429) (← links)
- The value of information sharing in the presence of supply uncertainty and demand volatility (Q5444499) (← links)