Pages that link to "Item:Q4887780"
From MaRDI portal
The following pages link to An <i>O</i>(<i>T</i><sup>3</sup>) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities (Q4887780):
Displaying 50 items.
- The economic lot-sizing problem with perishable items and consumption order preference (Q319481) (← links)
- 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)
- Capacitated lot sizing problems with inventory bounds (Q492789) (← links)
- Stochastic lot-sizing with backlogging: computational complexity analysis (Q537961) (← links)
- Capacitated dynamic lot-sizing problem with delivery/production time windows (Q613340) (← links)
- Stochastic lot-sizing problem with inventory-bounds and constant order-capacities (Q613461) (← 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)
- Warehouse location with production, inventory, and distribution decisions: a case study in the lube oil industry (Q742505) (← 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)
- Analysis of bounds for a capacitated single-item lot-sizing problem (Q858280) (← links)
- A heuristic approach for big bucket multi-level production planning problems (Q958084) (← links)
- Capacitated procurement planning with price-sensitive demand and general concave-revenue functions (Q1002053) (← links)
- Multi-item lot-sizing with joint set-up costs (Q1013968) (← links)
- A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure (Q1042524) (← links)
- Stability aspects of the traveling salesman problem based on \(k\)-best solutions (Q1270780) (← links)
- Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions (Q1331605) (← links)
- Heuristics based on genetic algorithms for the capacitated multi vehicle production distribution problem (Q1652661) (← links)
- A polynomial time algorithm to the economic lot sizing problem with constant capacity and piecewise linear concave costs (Q1728316) (← links)
- Improved exact algorithms to economic lot-sizing with piecewise linear production costs (Q1752258) (← links)
- An efficient algorithm for the 2-level capacitated lot-sizing problem with identical capacities at both levels (Q1753642) (← links)
- Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost (Q1758285) (← links)
- A hybrid polynomial-time algorithm for the dynamic quantity discount lot size model with resale (Q1762169) (← links)
- A polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows (Q1785294) (← links)
- Capacitated lot-sizing problem with outsourcing (Q1785408) (← links)
- A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs (Q1926904) (← links)
- Production lot-sizing with dynamic capacity adjustment (Q1991128) (← links)
- Subcontracting and lot-sizing with constant capacities (Q2133416) (← links)
- Economic lot sizing problem with inventory dependent demand (Q2228391) (← links)
- A Lagrangian heuristic for capacitated single item lot sizing problems (Q2351162) (← links)
- Dynamic lot-sizing model for major and minor demands (Q2384637) (← links)
- Economic lot sizing: the capacity reservation model (Q2450755) (← links)
- Lot-sizing with non-stationary cumulative capacities (Q2457275) (← links)
- A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems (Q2459395) (← links)
- Single item lot-sizing problem for a warm/cold process with immediate lost sales (Q2467270) (← links)
- Lot sizing with inventory gains (Q2467450) (← 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)
- Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount (Q2669493) (← links)
- Single-item lot-sizing with quantity discount and bounded inventory (Q2670451) (← links)
- On the Computational Complexity of Minimum-Concave-Cost Flow in a Two-Dimensional Grid (Q2828332) (← 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 Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging (Q3503865) (← links)
- A genetic algorithm heuristic approach to general outsourcing capacitated production planning problems (Q3532781) (← links)
- Capacitated production planning with outsourcing in an OKP company (Q3541177) (← links)
- Multiechelon Lot Sizing: New Complexities and Inequalities (Q5131474) (← links)
- Évaluation de la fiabilité d'un système de prévision de la demande dans le cas d'une politique de regroupement des besoins (Q5479835) (← links)
