Worst case analysis of relax and fix heuristics for lot-sizing problems
From MaRDI portal
Publication:2312339
DOI10.1016/j.ejor.2019.06.010zbMath1430.90005OpenAlexW2953230548WikidataQ127717632 ScholiaQ127717632MaRDI QIDQ2312339
Nabil Absi, Wilco van den Heuvel
Publication date: 5 July 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2019.06.010
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Inventory, storage, reservoirs (90B05)
Related Items
Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost ⋮ A rolling-horizon approach for multi-period optimization ⋮ Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem ⋮ A kernel search heuristic for the multivehicle inventory routing problem ⋮ Optimization of the cutting process integrated to the lot sizing in multi-plant paper production industries
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Capacitated lot sizing with parallel machines, sequence-dependent setups, and a common setup operator
- A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems
- Single and parallel machine capacitated lotsizing and scheduling: new iterative MIP-based neighborhood search heuristics
- Multilevel capacitated lotsizing complexity and LP-based heuristics
- A heuristic approach for big bucket multi-level production planning problems
- Worst case performance for lot sizing heuristics
- Optimal placement of add/drop multiplexers: Static and dynamic models
- Production planning with order acceptance and demand uncertainty
- Hybrid simulated annealing and MIP-based heuristics for stochastic lot-sizing and scheduling problem in capacitated multi-stage production system
- An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times
- A General Heuristic for Production Planning Problems
- Worst-Case Analysis for a General Class of Online Lot-Sizing Heuristics
- The Capacitated Lot-Sizing Problem with Linked Lot Sizes
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
- MIP-based heuristics for lotsizing in capacitated pure flow shop with sequence-dependent setups
- Approximation Methods for the Uncapacitated Dynamic Lot Size Problem
- Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems
- MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs
- Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- Note—Performance Bounds for Lot Sizing Heuristics
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Rolling-horizon lot-sizing when set-up times are sequence-dependent
- LP-based heuristics for the capacitated lot-sizing problem: The interaction of model formulation and solution algorithm
