A horizon decomposition approach for the capacitated lot-sizing problem with setup times
From MaRDI portal
Publication:2830951
DOI10.1287/IJOC.2016.0691zbMATH Open1348.90486OpenAlexW2395192183MaRDI QIDQ2830951FDOQ2830951
Authors: Ioannis Fragkos, Zeger Degraeve, Bert De Reyck 
Publication date: 1 November 2016
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/5ab23e57058d39946af44f8343b02606cacd287c
Recommendations
- Comparing Dantzig-Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem
- Period decompositions for the capacitated lot sizing problem with setup times
- A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
- Improved lower bounds for the capacitated lot sizing problem with setup times.
- Hybrid methods for lot sizing on parallel machines
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Integer programming (90C10) Mixed integer programming (90C11)
Cites Work
- Selected Topics in Column Generation
- Stabilized column generation
- Branch-and-price: Column generation for solving huge integer programs
- Partial convexification of general mips by Dantzig-Wolfe reformulation
- Implementing Mixed Integer Column Generation
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Branching in branch-and-price: A generic scheme
- Dynamic version of the economic lot size model
- Decomposition Principle for Linear Programs
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- A generic view of Dantzig--Wolfe decomposition in mixed integer programming
- Lot-sizing with start-up times
- Global Optimality Conditions for Discrete and Nonconvex Optimization—With Applications to Lagrangian Heuristics and Column Generation
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Dynamic Aggregation of Set-Partitioning Constraints in Column Generation
- Lagrangean relaxation based heuristics for lot sizing with setup times
- Optimal integer solutions to industrial cutting-stock problems. II: Benchmark results
- Dual-Optimal Inequalities for Stabilized Column Generation
- A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
- A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times
- On compact formulations for integer programs solved by column generation
- Improved lower bounds for the capacitated lot sizing problem with setup times.
- Period decompositions for the capacitated lot sizing problem with setup times
- Comparing Dantzig-Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem
- Uncapacitated lot-sizing: The convex hull of solutions
- Approximate extended formulations
- A computational analysis of lower bounds for big bucket production planning problems
- A Lower Bounding Structure for Lot-Size Scheduling Problems
- Automatic Dantzig-Wolfe reformulation of mixed integer programs
- Local cuts and two-period convex hull closures for big-bucket lot-sizing problems
Cited In (20)
- Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials
- A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
- Solving capacitated part-routing problems with setup times and costs: a Dantzig-Wolfe decomposition-based solution approach
- Multiechelon Lot Sizing: New Complexities and Inequalities
- Avoiding redundant columns by adding classical Benders cuts to column generation subproblems
- Decomposition based heuristic algorithm for lot-sizing and scheduling problem treating time horizon as a continuum
- A supervised learning-driven heuristic for solving the facility location and production planning problem
- Predictive search for capacitated multi-item lot sizing problems
- The green capacitated multi-item lot sizing problem with parallel machines
- Partial objective inequalities for the multi-item capacitated lot-sizing problem
- A modeling and hybridized decomposition approach for the multi-level capacitated lot-sizing problem with setup carryover, backlogging, and emission control
- Dantzig-Wolfe decomposition for the facility location and production planning problem
- Analytics branching and selection for the capacitated multi-item lot sizing problem with nonidentical machines
- Progressive selection method for the coupled lot-sizing and cutting-stock problem
- A rolling-horizon approach for multi-period optimization
- A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times
- Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem
- New construction heuristic for capacitated lot sizing problems
- A matheuristic for the generalized order acceptance and scheduling problem
- Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions
This page was built for publication: A horizon decomposition approach 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 Q2830951)
