A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times
From MaRDI portal
Publication:2830951
DOI10.1287/ijoc.2016.0691zbMath1348.90486OpenAlexW2395192183MaRDI QIDQ2830951
Ioannis Fragkos, Zeger Degraeve, De Reyck, Bert
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
Integer programming (90C10) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items
A supervised learning-driven heuristic for solving the facility location and production planning problem ⋮ The green capacitated multi-item lot sizing problem with parallel machines ⋮ Partial objective inequalities for the multi-item capacitated lot-sizing problem ⋮ Predictive Search for Capacitated Multi-Item Lot Sizing Problems ⋮ Dantzig-Wolfe decomposition for the facility location and production planning problem ⋮ A rolling-horizon approach for multi-period optimization ⋮ Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem ⋮ New construction heuristic for capacitated lot sizing problems ⋮ Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem ⋮ Multiechelon Lot Sizing: New Complexities and Inequalities ⋮ Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines ⋮ Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials ⋮ Avoiding redundant columns by adding classical Benders cuts to column generation subproblems ⋮ A matheuristic for the generalized order acceptance and scheduling problem
Cites Work
- A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times
- Branching in branch-and-price: A generic scheme
- On compact formulations for integer programs solved by column generation
- Lagrangean relaxation based heuristics for lot sizing with setup times
- Stabilized column generation
- Improved lower bounds for the capacitated lot sizing problem with setup times.
- Exploring relaxation induced neighborhoods to improve MIP solutions
- A computational analysis of lower bounds for big bucket production planning problems
- A generic view of Dantzig--Wolfe decomposition in mixed integer programming
- Automatic Dantzig-Wolfe reformulation of mixed integer programs
- Approximate extended formulations
- Dynamic Version of the Economic Lot Size Model
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Lot-Sizing with Start-Up Times
- Optimal Integer Solutions to Industrial Cutting-Stock Problems: Part 2, Benchmark Results
- Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems
- Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
- Decomposition Principle for Linear Programs
- Uncapacitated lot-sizing: The convex hull of solutions
- Global Optimality Conditions for Discrete and Nonconvex Optimization—With Applications to Lagrangian Heuristics and Column Generation
- 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
- 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
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- A Lower Bounding Structure for Lot-Size Scheduling Problems
- Dynamic Aggregation of Set-Partitioning Constraints in Column Generation
- Selected Topics in Column Generation
- Implementing Mixed Integer Column Generation
