Polynomial-Time Solvability of Dynamic Lot Size Problems
From MaRDI portal
Publication:3188765
DOI10.1142/S0217595916500184zbMath1345.90005MaRDI QIDQ3188765
Publication date: 12 August 2016
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Cites Work
- An \(O(T^{3})\) algorithm for the capacitated lot sizing problem with minimum order quantities
- Inventory replenishment model: lot sizing versus just-in-time delivery.
- A polynomial algorithm for the production/ordering planning problem with limited storage
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
- An \(O(n^2)\) algorithm for lot sizing with inventory bounds and fixed costs
- Four equivalent lot-sizing models
- Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs
- A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure
- Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost
- 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 time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs
- An FPTAS for the single-item capacitated economic lot-sizing problem with supply and demand
- The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial cases
- Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
- Economic lot sizing: the capacity reservation model
- Economic lot sizing problem with inventory bounds
- An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure
- Polynomial cases of the economic lot sizing problem with cost discounts
- Single item lot sizing problems
- Approximating the Nonlinear Newsvendor and Single-Item Stochastic Lot-Sizing Problems When Data Is Given by an Oracle
- The dynamic lot size model with quantity discount
- On the Effectiveness of Zero-Inventory-Ordering Policies for the Economic Lot-Sizing Model with a Class of Piecewise Linear Cost Structures
- A Dynamic Lot-Size Model with Make-or-Buy Decisions
- Deterministic Production Planning: Algorithms and Complexity
- A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
- Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
- Bounded Production and Inventory Models with Piecewise Concave Costs
- Improved Algorithms for Economic Lot Size Problems
- The dynamic lot size model with quantity discount: Counterexamples and correction
- Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
- A Deterministic Multi-Period Production Scheduling Model with Backlogging
- A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
- Optimization of Batch Ordering under Deterministic Variable Demand
- Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems
This page was built for publication: Polynomial-Time Solvability of Dynamic Lot Size Problems