A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
From MaRDI portal
Publication:3392124
Recommendations
- Comparing Dantzig-Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem
- A Lagrangean relaxation approach for capacitated lot sizing problem with setup times
- Improved lower bounds for the capacitated lot sizing problem with setup times.
- A horizon decomposition approach for the capacitated lot-sizing problem with setup times
- A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing
- The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times
- Solving capacitated part-routing problems with setup times and costs: a Dantzig-Wolfe decomposition-based solution approach
- The multi-item capacitated lot-sizing problem with setup times and shortage costs
- Multi-item capacitated lot-sizing problems with setup times and pricing decisions
Cited in
(48)- Local cuts and two-period convex hull closures for big-bucket lot-sizing problems
- Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines
- Column generation based primal heuristics
- Integrated lot sizing and blending problems
- A modeling and hybridized decomposition approach for the multi-level capacitated lot-sizing problem with setup carryover, backlogging, and emission control
- A computational analysis of lower bounds for big bucket production planning problems
- Joint optimisation of drone routing and battery wear for sustainable supply chain development: a mixed-integer programming model based on blockchain-enabled fleet sharing
- Integrated districting, fleet composition, and inventory planning for a multi-retailer distribution system
- Integrated bin packing and lot-sizing problem considering the configuration-dependent bin packing process
- A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times
- Hybrid methods for lot sizing on parallel machines
- Dantzig-Wolfe decomposition for the facility location and production planning problem
- Period decompositions for the capacitated lot sizing problem with setup times
- Timed route approaches for large multi-product multi-step capacitated production planning problems
- Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover
- Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems
- Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups
- Just-in-time planning and lot-sizing
- Progressive selection method for the coupled lot-sizing and cutting-stock problem
- Regenerator location problem in flexible optical networks
- Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case
- A horizon decomposition approach for the capacitated lot-sizing problem with setup times
- A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems
- Primal Heuristics for Branch and Price: The Assets of Diving Methods
- Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs
- The green capacitated multi-item lot sizing problem with parallel machines
- Improved lower bounds for the capacitated lot sizing problem with setup times.
- A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing
- Analytics branching and selection for the capacitated multi-item lot sizing problem with nonidentical machines
- Comparing Dantzig-Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem
- Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
- A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times
- A generic view of Dantzig--Wolfe decomposition in mixed integer programming
- Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost
- Classification and literature review of integrated lot-sizing and cutting stock problems
- Predictive search for capacitated multi-item lot sizing problems
- A branch-and-price algorithm for stable workforce assignments with hierarchical skills
- Solving capacitated part-routing problems with setup times and costs: a Dantzig-Wolfe decomposition-based solution approach
- Branch and Price for Chance-Constrained Bin Packing
- Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem
- New construction heuristic for capacitated lot sizing problems
- Heuristics for the multi-item capacitated lot-sizing problem with lost sales
- Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior
- Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing
- An integer programming column generation principle for heuristic search methods
- Multi-item capacitated lot-sizing problems with setup times and pricing decisions
- Reformulation by discretization: application to economic lot sizing
This page was built for publication: A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3392124)
