Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation
From MaRDI portal
Recommendations
Cited in
(42)- On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times
- Discrete lot sizing and scheduling using product decomposition into attributes
- Multi-item lot-sizing with joint set-up costs
- Uncapacitated lot sizing with backlogging: the convex hull
- The synchronized and integrated two-level lot sizing and scheduling problem: evaluating the generalized mathematical model
- Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials
- Workforce planning in a lotsizing mail processing problem
- Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set
- A computational analysis of lower bounds for big bucket production planning problems
- Operations planning test bed under rolling horizons, multiproduct, multiechelon, multiprocess for capacitated production planning modelling with \textit{strokes}
- Pricing, relaxing and fixing under lot sizing and scheduling
- Simultaneous lotsizing and scheduling problems: a classification and review of models
- A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
- A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems
- Reformulation by discretization: application to economic lot sizing
- Lot sizing with inventory gains
- Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity
- Comparative approaches to equipment scheduling in high volume factories
- Approximate extended formulations
- Lead time considerations for the multi-level capacitated lot-sizing problem
- LS-LIB: a library of tools for solving production planning problems
- Exact solution approaches for the discrete lot-sizing and scheduling problem with parallel resources
- Scheduling two chains of unit jobs on one machine: a polyhedral study
- Modelling practical lot-sizing problems as mixed-integer programs
- Unequal individual genetic algorithm with intelligent diversification for the lot-scheduling problem in integrated mills using multiple-paper machines
- Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems
- Service level robustness in stochastic production planning under random machine breakdowns
- A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times
- Uncapacitated lot-sizing with buying, sales and backlogging
- scientific article; zbMATH DE number 780785 (Why is no real title available?)
- Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups
- Integrated production planning and preventive maintenance in deteriorating production systems
- Multi‐level, multi‐stage lot‐sizing and scheduling in the flexible flow shop with demand information updating
- A graph-based decomposition method for convex quadratic optimization with indicators
- Supply chain management and advanced planning -- basics, overview and challenges
- Supply chain management in forestry -- case studies at Södra cell AB
- Integrating process optimization and inventory planning in cutting-stock with skiving option: an optimization model and its application
- On a fix-and-relax framework for a class of project scheduling problems
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
- Production planning and warehouse management in supply networks with inter-facility mold transfers
- A heuristic approach for big bucket multi-level production planning problems
- Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution
This page was built for publication: Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3114820)
