An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
From MaRDI portal
Publication:4887780
DOI10.1287/mnsc.42.1.142zbMath0851.90058OpenAlexW2124420415MaRDI QIDQ4887780
Albert P. M. Wagelmans, Stan P. M. 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
Abstract computational complexity for mathematical programming problems (90C60) Production models (90B30)
Related Items
Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions ⋮ Subcontracting and lot-sizing with constant capacities ⋮ Single item lot-sizing with non-decreasing capacities ⋮ The economic lot-sizing problem with perishable items and consumption order preference ⋮ Dual-mode production planning for manufacturing with emission constraints ⋮ Dynamic lot-sizing model for major and minor demands ⋮ Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches ⋮ Analysis of bounds for a capacitated single-item lot-sizing problem ⋮ Heuristics based on genetic algorithms for the capacitated multi vehicle production distribution problem ⋮ Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount ⋮ A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs ⋮ Single-item lot-sizing with quantity discount and bounded inventory ⋮ Capacitated dynamic lot-sizing problem with delivery/production time windows ⋮ Stochastic lot-sizing problem with inventory-bounds and constant order-capacities ⋮ Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in \(O(N \log N)\) time ⋮ A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging ⋮ A dynamic programming approach for the two-product capacitated lot-sizing problem with concave costs ⋮ An \(O(T^{3})\) algorithm for the capacitated lot sizing problem with minimum order quantities ⋮ Economic lot sizing problem with tank scheduling ⋮ A genetic algorithm heuristic approach to general outsourcing capacitated production planning problems ⋮ Multiechelon Lot Sizing: New Complexities and Inequalities ⋮ Economic lot sizing: the capacity reservation model ⋮ Capacitated production planning with outsourcing in an OKP company ⋮ A polynomial time algorithm to the economic lot sizing problem with constant capacity and piecewise linear concave costs ⋮ Economic lot sizing problem with inventory dependent demand ⋮ Lot-sizing with non-stationary cumulative capacities ⋮ Integrated production planning and preventive maintenance in deteriorating production systems ⋮ A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems ⋮ Capacitated lot sizing problems with inventory bounds ⋮ Single item lot-sizing problem for a warm/cold process with immediate lost sales ⋮ Lot sizing with inventory gains ⋮ A linear-time algorithm for finding optimal vehicle refueling policies ⋮ Production lot-sizing with dynamic capacity adjustment ⋮ Improved exact algorithms to economic lot-sizing with piecewise linear production costs ⋮ An efficient algorithm for the 2-level capacitated lot-sizing problem with identical capacities at both levels ⋮ A heuristic approach for big bucket multi-level production planning problems ⋮ Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost ⋮ A single-item economic lot-sizing problem with a non-uniform resource: Approximation ⋮ Stochastic lot-sizing with backlogging: computational complexity analysis ⋮ A hybrid polynomial-time algorithm for the dynamic quantity discount lot size model with resale ⋮ Decentralized supply chain coordination through auction markets: dynamic lot-sizing in distribution networks ⋮ An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem ⋮ A polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows ⋮ Capacitated lot-sizing problem with outsourcing ⋮ Lot sizing with bounded inventory and lost sales ⋮ A Greedy Algorithm for Capacitated Lot-Sizing Problems ⋮ Capacitated procurement planning with price-sensitive demand and general concave-revenue functions ⋮ Warehouse location with production, inventory, and distribution decisions: a case study in the lube oil industry ⋮ An integrated model for inventory and production planning in a two-stage hybrid production system ⋮ Grouping in decomposition method for multi-item capacitated lot-sizing problem with immediate lost sales and joint and item-dependent setup cost ⋮ Multi-item lot-sizing with joint set-up costs ⋮ Stability aspects of the traveling salesman problem based on \(k\)-best solutions ⋮ Évaluation de la fiabilité d'un système de prévision de la demande dans le cas d'une politique de regroupement des besoins ⋮ On the Computational Complexity of Minimum-Concave-Cost Flow in a Two-Dimensional Grid ⋮ A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure ⋮ Single item lot sizing problems ⋮ A Lagrangian heuristic for capacitated single item lot sizing problems
