Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems
From MaRDI portal
Recommendations
- Modelling practical lot-sizing problems as mixed-integer programs
- Two mixed integer programming formulations arising in manufacturing management
- A linear description of the discrete lot-sizing and scheduling problem
- Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation
- Strong Formulations for Multi-Item Capacitated Lot Sizing
Cited in
(22)- Multi-item lot-sizing with joint set-up costs
- Two mixed integer programming formulations arising in manufacturing management
- A linear description of the discrete lot-sizing and scheduling problem
- Simultaneous lotsizing and scheduling problems: a classification and review of models
- Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms
- Cascading knapsack inequalities: reformulation of a crude oil distribution problem
- Manufacturer's mixed pallet design problem
- Reformulation by discretization: application to economic lot sizing
- Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity
- An evaluation of semidefinite programming based approaches for discrete lot-sizing problems
- Approximate extended formulations
- Discrete multi-module capacitated lot-sizing problems with multiple items
- MIP formulations for a rich real-world lot-sizing problem with setup carryover
- LS-LIB: a library of tools for solving production planning problems
- Modelling practical lot-sizing problems as mixed-integer programs
- Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation
- Tight second stage formulations in two-stage stochastic mixed integer programs
- Modeling industrial lot sizing problems: a review
- Discrepancies in solutions between traditional and net present value formulations of finite horizon, discrete-time economic lot size problems
- Integration of sales and operations: a dynamic mixed-integer programming game
- Compact formulations as a union of polyhedra
- Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution
This page was built for publication: Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637368)
