An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
From MaRDI portal
DOI10.1287/MNSC.42.1.142zbMATH Open0851.90058OpenAlexW2124420415MaRDI QIDQ4887780FDOQ4887780
Albert P. M. Wagelmans, Stan Van Hoesel
Publication date: 25 November 1996
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.42.1.142
Recommendations
- Economic lot sizing with constant capacities and concave inventory costs
- A polynomial time algorithm to the economic lot sizing problem with constant capacity and piecewise linear concave costs
- Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in \(O(N \log N)\) time
- Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
- An algorithm for single-item capacitated economic lot sizing with piecewise linear production costs and general holding costs
Abstract computational complexity for mathematical programming problems (90C60) Production models (90B30)
Cited In (61)
- Economic lot sizing problem with tank scheduling
- Évaluation de la fiabilité d'un système de prévision de la demande dans le cas d'une politique de regroupement des besoins
- A dynamic programming approach for the two-product capacitated lot-sizing problem with concave costs
- A linear-time algorithm for finding optimal vehicle refueling policies
- An integrated model for inventory and production planning in a two-stage hybrid production system
- A polynomial time algorithm to the economic lot sizing problem with constant capacity and piecewise linear concave costs
- Improved exact algorithms to economic lot-sizing with piecewise linear production costs
- Stochastic lot-sizing with backlogging: computational complexity analysis
- Single item lot-sizing problem for a warm/cold process with immediate lost sales
- Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
- Single item lot-sizing with non-decreasing capacities
- Heuristics based on genetic algorithms for the capacitated multi vehicle production distribution problem
- Economic lot sizing problem with inventory dependent demand
- A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging
- Analysis of bounds for a capacitated single-item lot-sizing problem
- Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions
- An O(T2) Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem
- Multiechelon Lot Sizing: New Complexities and Inequalities
- An efficient algorithm for the 2-level capacitated lot-sizing problem with identical capacities at both levels
- An efficient algorithm for the capacitated single item dynamic lot size problem
- Stability aspects of the traveling salesman problem based on \(k\)-best solutions
- The economic lot-sizing problem with perishable items and consumption order preference
- A polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows
- Economic lot sizing: the capacity reservation model
- A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure
- Warehouse location with production, inventory, and distribution decisions: a case study in the lube oil industry
- Single-item lot-sizing with quantity discount and bounded inventory
- Dual-mode production planning for manufacturing with emission constraints
- Capacitated lot-sizing problem with outsourcing
- Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in \(O(N \log N)\) time
- Grouping in decomposition method for multi-item capacitated lot-sizing problem with immediate lost sales and joint and item-dependent setup cost
- Integrated production planning and preventive maintenance in deteriorating production systems
- Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost
- An \(O(T^{3})\) algorithm for the capacitated lot sizing problem with minimum order quantities
- Decentralized supply chain coordination through auction markets: dynamic lot-sizing in distribution networks
- Lot sizing with bounded inventory and lost sales
- On the computational complexity of minimum-concave-cost flow in a two-dimensional grid
- A genetic algorithm heuristic approach to general outsourcing capacitated production planning problems
- Capacitated dynamic lot-sizing problem with delivery/production time windows
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
- Capacitated procurement planning with price-sensitive demand and general concave-revenue functions
- A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems
- An algorithm for single-item capacitated economic lot sizing with piecewise linear production costs and general holding costs
- Subcontracting and lot-sizing with constant capacities
- A heuristic approach for big bucket multi-level production planning problems
- Capacitated production planning with outsourcing in an OKP company
- Multi-item lot-sizing with joint set-up costs
- Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount
- Capacitated lot sizing problems with inventory bounds
- A hybrid polynomial-time algorithm for the dynamic quantity discount lot size model with resale
- Dynamic lot-sizing model for major and minor demands
- Stochastic lot-sizing problem with inventory-bounds and constant order-capacities
- Lot sizing with inventory gains
- A single-item economic lot-sizing problem with a non-uniform resource: Approximation
- Single item lot sizing problems
- A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs
- Production lot-sizing with dynamic capacity adjustment
- A Lagrangian heuristic for capacitated single item lot sizing problems
- Lot-sizing with non-stationary cumulative capacities
- An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem
- A Greedy Algorithm for Capacitated Lot-Sizing Problems
This page was built for publication: An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4887780)
