Lot sizing with minimum order quantity
From MaRDI portal
Publication:479047
DOI10.1016/j.dam.2014.09.015zbMath1311.90079OpenAlexW2144425464MaRDI QIDQ479047
Publication date: 5 December 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.09.015
Related Items
The single-item green lot-sizing problem with fixed carbon emissions, Quadratic Convex Reformulations for Semicontinuous Quadratic Programming, Forecast horizon of dynamic lot size model for perishable inventory with minimum order quantities, Relaxations of Discrete Sets with Semicontinuous Variables, Single-item dynamic lot-sizing problems: an updated survey, A dynamic lot sizing model with production-or-outsourcing decision under minimum production quantities, A simple heuristic policy for stochastic inventory systems with both minimum and maximum order quantity requirements
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.
- Single item lot-sizing with non-decreasing capacities
- Multi-item lot-sizing with joint set-up costs
- Valid inequalities and separation for capacitated economic lot sizing
- Polyhedra for lot-sizing with Wagner-Whitin costs
- A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs
- Semi-continuous network flow problems
- Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity
- Lower Bounds in Lot-Sizing Models: A Polyhedral Study
- Dynamic Version of the Economic Lot Size Model
- ON THE STRUCTURE OF OPTIMAL ORDERING POLICIES FOR STOCHASTIC INVENTORY SYSTEMS WITH MINIMUM ORDER QUANTITY
- Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- Production Planning by Mixed Integer Programming
