Polynomial-time solvability of dynamic lot size problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3945840
- Capacitated dynamic lot-sizing problem with delivery/production time windows
- TECHNICAL NOTE—Solving Linear Cost Dynamic Lot-Sizing Problems in O(n log n) Time
- A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
- A polynomial time algorithm for convex cost lot-sizing problems
Cites work
- A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
- A Deterministic Multi-Period Production Scheduling Model with Backlogging
- A Dynamic Lot-Size Model with Make-or-Buy Decisions
- A hybrid polynomial-time algorithm for the dynamic quantity discount lot size model with resale
- A new characterization for the dynamic lot size problem with bounded inventory
- A polynomial algorithm for the production/ordering planning problem with limited storage
- A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs
- A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
- A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure
- An O(n^2) algorithm for lot sizing with inventory bounds and fixed costs
- An \(O(T^{3})\) algorithm for the capacitated lot sizing problem with minimum order quantities
- An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure
- An FPTAS for the single-item capacitated economic lot-sizing problem with supply and demand
- Approximating the nonlinear newsvendor and single-item stochastic lot-sizing problems when data is given by an oracle
- Bounded Production and Inventory Models with Piecewise Concave Costs
- Deterministic Production Planning: Algorithms and Complexity
- Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
- Economic lot sizing problem with inventory bounds
- Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
- Economic lot sizing: the capacity reservation model
- Four equivalent lot-sizing models
- Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems
- Improved Algorithms for Economic Lot Size Problems
- Inventory replenishment model: lot sizing versus just-in-time delivery.
- Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
- On the Effectiveness of Zero-Inventory-Ordering Policies for the Economic Lot-Sizing Model with a Class of Piecewise Linear Cost Structures
- Optimization of Batch Ordering under Deterministic Variable Demand
- Polynomial cases of the economic lot sizing problem with cost discounts
- Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost
- Single item lot sizing problems
- The dynamic lot size model with quantity discount
- The dynamic lot size model with quantity discount: Counterexamples and correction
- The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial cases
- Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs
Cited in
(5)- An algorithm based on a new sufficient condition of optimality in dynamic lot size model
- A polynomial time algorithm for convex cost lot-sizing problems
- Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
- scientific article; zbMATH DE number 3945840 (Why is no real title available?)
- Purchase and production optimization in a meat processing plant
This page was built for publication: Polynomial-time solvability of dynamic lot size problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3188765)
