Four equivalent lot-sizing models
From MaRDI portal
Recommendations
- Lot sizing and scheduling -- survey and extensions
- Equivalent formulations for economic lot-sizing problem with remanufacturing and joint setups
- Lot sizing with inventory gains
- Equivalence classes of problem instances for a continuous-time lot sizing and scheduling problem
- Economic lot-sizing problem with remanufacturing option: complexity and algorithms
Cites work
- A dynamic lot-sizing model with demand time windows
- An O(n^2) algorithm for lot sizing with inventory bounds and fixed costs
- Bounded Production and Inventory Models with Piecewise Concave Costs
- Dynamic version of the economic lot size model
- Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
- Economic lot sizing problem with inventory bounds
- Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation
- Lot-sizing with non-stationary cumulative capacities
- Lot-sizing with production and delivery time windows
- Remanufacturing planning for the reverse Wagner/Whitin models
Cited in
(17)- Uncapacitated lot-sizing problem with production time windows, early productions, backlogs and lost sales
- Just-in-time planning and lot-sizing
- Single-item dynamic lot-sizing problems: an updated survey
- A polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows
- Equivalent formulations for economic lot-sizing problem with remanufacturing and joint setups
- Variable neighborhood formulation search approach for the multi-item capacitated lot-sizing problem with time windows and setup times
- Polynomial-time solvability of dynamic lot size problems
- Convex hull results for generalizations of the constant capacity single node flow set
- On the computational complexity of minimum-concave-cost flow in a two-dimensional grid
- A branch-and-cut algorithm for an assembly routing problem
- Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times
- Stochastic lot-sizing problem with inventory-bounds and constant order-capacities
- Lot sizing with inventory gains
- Erratum: a tight formulation for uncapacitated lot-sizing with stock upper bounds
- A polynomial time algorithm for convex cost lot-sizing problems
- Minimum concave cost flow over a grid network
- A Lagrangian heuristic for capacitated single item lot sizing problems
This page was built for publication: Four equivalent lot-sizing models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1003497)
