Lot sizing with inventory gains
From MaRDI portal
Publication:2467450
DOI10.1016/J.ORL.2007.01.005zbMath1180.90107OpenAlexW2088343923MaRDI QIDQ2467450
Publication date: 21 January 2008
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2007.01.005
Deterministic scheduling theory in operations research (90B35) Production models (90B30) Inventory, storage, reservoirs (90B05)
Related Items (1)
Integrating deterioration and lifetime constraints in production and supply chain planning: a survey
Cites Work
- Unnamed Item
- Unnamed Item
- A survey of dynamic network flows
- A network-related nuclear power plant model with an intelligent branch- and-bound solution approach
- Valid inequalities and separation for capacitated economic lot sizing
- Optimizing nuclear power plant refueling with mixed-integer programming
- Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
- Gainfree Leontief substitution flow problems
- Polyhedra for lot-sizing with Wagner-Whitin costs
- Dynamic Version of the Economic Lot Size Model
- Dynamic Economic Lot Size Model with Perishable Inventory
- Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation
- Uncapacitated lot-sizing: The convex hull of solutions
- Valid Linear Inequalities for Fixed Charge Problems
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Optimal Multi-Level Lot Sizing for Requirements Planning Systems
- Generalizations of Hoffman's existence theorem for circulations
- Perishable Inventory Theory: A Review
- Computational Complexity of the Capacitated Lot Size Problem
- Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
- On Max Flows with Gains and Pure Min-Cost Flows
- A Dynamic Lot-Size Model With Inventory Deterioration
- An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- Minimum Concave Cost Flows in Certain Networks
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
This page was built for publication: Lot sizing with inventory gains
