Motivations and analysis of the capacitated lot-sizing problem with setup times and minimum and maximum ending inventories
From MaRDI portal
Publication:2140332
Recommendations
- MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs
- An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times
- Algorithms for Capacitated, Multi-Item Lot-Sizing without Set-Ups
- Period decompositions for the capacitated lot sizing problem with setup times
- Capacitated lot sizing under setup learning
Cites work
- A comparison of methods for lot-sizing in a rolling horizon environment
- Capacitated Multi-Item Lot-Sizing Problems with Time Windows
- Dynamic version of the economic lot size model
- Ending inventory valuation in multiperiod production scheduling
- Improved rolling schedules for the dynamic single-level lot-sizing problem
- Lagrangean relaxation based heuristics for lot sizing with setup times
- MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs
- Minimal Forecast Horizons and a New Planning Procedure for the General Dynamic Lot Sizing Model: Nervousness Revisited
- Modeling industrial lot sizing problems: a review
- Period decompositions for the capacitated lot sizing problem with setup times
- Production Planning by Mixed Integer Programming
- Rolling-horizon lot-sizing when set-up times are sequence-dependent
- Single-item dynamic lot-sizing problems: an updated survey
- The multi-item capacitated lot-sizing problem with setup times and shortage costs
This page was built for publication: Motivations and analysis of the capacitated lot-sizing problem with setup times and minimum and maximum ending inventories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2140332)