Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case
From MaRDI portal
Publication:1754210
DOI10.1016/j.ejor.2017.11.014zbMath1403.90015OpenAlexW2768993491MaRDI QIDQ1754210
Kerem Akartunalı, Mahdi Doostmohammadi
Publication date: 30 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.11.014
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Production models (90B30) Inventory, storage, reservoirs (90B05)
Related Items (6)
An analysis of the integrated lot-sizing and cutting-stock problem formulation ⋮ Dynamic lot sizing with stochastic demand timing ⋮ Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost ⋮ Valid inequalities and extended formulations for lot-sizing and scheduling problem with sequence-dependent setups ⋮ Robust formulations for economic lot-sizing problem with remanufacturing ⋮ Improving connectivity of compromised digital networks via algebraic connectivity maximisation
Uses Software
Cites Work
- Unnamed Item
- Relaxations for two-level multi-item lot-sizing problems
- Single item lot-sizing with non-decreasing capacities
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
- Analysis of relaxations for the multi-item capacitated lot-sizing problem
- Uncapacitated lot sizing with backlogging: the convex hull
- On the polyhedral structure of a multi-item production planning model with setup times
- Improved lower bounds for the capacitated lot sizing problem with setup times.
- Polyhedra for lot-sizing with Wagner-Whitin costs
- A computational analysis of lower bounds for big bucket production planning problems
- Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
- Approximate extended formulations
- Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
- A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands
- Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems
- 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
- Valid Linear Inequalities for Fixed Charge Problems
- Heuristics for Multilevel Lot-Sizing with a Bottleneck
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Modeling industrial lot sizing problems: a review
- Production Planning by Mixed Integer Programming
This page was built for publication: Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case
