The following pages link to Single item lot sizing problems (Q2566041):
Displaying 50 items.
- Integrating deterioration and lifetime constraints in production and supply chain planning: a survey (Q296854) (← links)
- Fenced in? Stochastic and deterministic planning models in a time-fenced, rolling-horizon scheduling system (Q322628) (← links)
- Optimal production-inventory policy for an integrated multi-stage supply chain with time-varying demand (Q323539) (← links)
- Effective replenishment policies for the multi-item dynamic lot-sizing problem with storage capacities (Q336647) (← links)
- A genetic algorithm/mathematical programming approach to solve a two-level soft drink production problem (Q337043) (← links)
- Heuristics for the multi-item capacitated lot-sizing problem with lost sales (Q339577) (← links)
- An \(O(T^{3})\) algorithm for the capacitated lot sizing problem with minimum order quantities (Q418062) (← 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)
- Classification and literature review of integrated lot-sizing and cutting stock problems (Q724044) (← links)
- Satisfying market demands with delivery obligations or delivery charges (Q732911) (← links)
- Warehouse location with production, inventory, and distribution decisions: a case study in the lube oil industry (Q742505) (← links)
- Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory (Q747754) (← links)
- An efficient procedure for dynamic lot-sizing model with demand time windows (Q868629) (← links)
- Lagrangean relaxation based heuristics for lot sizing with setup times (Q953424) (← links)
- A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times (Q954053) (← links)
- Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic (Q1010258) (← links)
- Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs (Q1026766) (← links)
- Capacitated dynamic lot sizing problems in closed-loop supply chain (Q1042061) (← links)
- Progress with single-item lot-sizing (Q1390225) (← links)
- Variable neighborhood descent heuristic for solving reverse logistics multi-item dynamic lot-sizing problems (Q1652102) (← links)
- The stochastic lot-sizing problem with quantity discounts (Q1652181) (← links)
- Heuristics based on genetic algorithms for the capacitated multi vehicle production distribution problem (Q1652661) (← links)
- Single-item dynamic lot-sizing problems: an updated survey (Q1694825) (← links)
- Two-stage absolute semi-deviation mean-risk stochastic programming: an application to the supply chain replenishment problem (Q1734824) (← links)
- Comparing sequential and integrated approaches for the production routing problem (Q1750476) (← links)
- Improved exact algorithms to economic lot-sizing with piecewise linear production costs (Q1752258) (← links)
- NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract (Q1752828) (← links)
- Dynamic lot-sizing models with pricing for new products (Q1753402) (← links)
- Joint dynamic pricing and lot-sizing under competition (Q1754157) (← links)
- A dynamic uncapacitated lot-sizing problem with co-production (Q1758049) (← links)
- A knapsack problem as a tool to solve the production planning problem in small foundries (Q1761949) (← links)
- Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior (Q1782155) (← links)
- A polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows (Q1785294) (← links)
- A polynomial time algorithm for convex cost lot-sizing problems (Q1785380) (← links)
- A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs (Q1926904) (← links)
- A primal-dual algorithm for computing a cost allocation in the core of economic lot-sizing games (Q1939686) (← links)
- Production lot-sizing with dynamic capacity adjustment (Q1991128) (← links)
- Transportation mode selection in inventory models: a literature review (Q2001452) (← links)
- Heuristic methods for the capacitated stochastic lot-sizing problem under the static-dynamic uncertainty strategy (Q2003567) (← links)
- Greedy algorithm for local heating problem (Q2019427) (← links)
- A single-item lot-sizing problem with a by-product and inventory capacities (Q2023969) (← links)
- Multi-period lot-sizing with supplier selection: structural results, complexity and algorithms (Q2060614) (← links)
- Robust optimization for lot-sizing problems under yield uncertainty (Q2108119) (← links)
- Dynamic optimization for coordinated replenishment system considering seasonal demand and price quantity discount (Q2109608) (← links)
- An integrated economic disposal and lot-sizing problem for perishable inventories with batch production and corrupt stock-dependent holding cost (Q2171384) (← links)
- Multi-echelon supply chains with lead times and uncertain demands. A lot-sizing formulation and solutions (Q2241314) (← links)
- HOPS -- Hamming-Oriented Partition Search for production planning in the spinning industry (Q2256197) (← links)
- A Lagrangian heuristic for capacitated single item lot sizing problems (Q2351162) (← links)
- Simultaneous production and maintenance planning for a single capacitated resource facing both a dynamic demand and intensive wear and tear (Q2358154) (← links)
- Integrated procurement-production inventory model for defective items with variable setup and ordering cost (Q2359228) (← links)
