On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times
From MaRDI portal
(Redirected from Publication:695342)
Recommendations
- Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times
- Period decompositions for the capacitated lot sizing problem with setup times
- An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- On alternative mixed integer programming formulations and LP-based heuristics for lot-sizing with setup times
Cites work
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3568353 (Why is no real title available?)
- A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
- A heuristic approach for big bucket multi-level production planning problems
- A heuristic for dynamic multi-item multi-level capacitated lotsizing for general product structures
- An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging
- Encyclopedia of Optimization
- Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times
- MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs
- Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction
- Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
- Particle swarm optimization for bi-level pricing problems in supply chains
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
Cited in
(10)- Progressive selection method for the coupled lot-sizing and cutting-stock problem
- Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms
- Analytics branching and selection for the capacitated multi-item lot sizing problem with nonidentical machines
- Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times
- Equivalent formulations for economic lot-sizing problem with remanufacturing and joint setups
- Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials
- A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders
- An efficient algorithm for the 2-level capacitated lot-sizing problem with identical capacities at both levels
- A robust optimization model for multi-product two-stage capacitated production planning under uncertainty
- Lead time considerations for the multi-level capacitated lot-sizing problem
This page was built for publication: On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q695342)
