A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems
From MaRDI portal
Publication:525062
DOI10.1007/s10732-015-9295-0zbMath1360.90306OpenAlexW2141800752MaRDI QIDQ525062
Kerem Akartunalı, Paulo Morelato França, Claudio Fabiano Motta Toledo, Marcelo Yukio Bressan Hossomi, Marcio da Silva Arantes
Publication date: 28 April 2017
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11449/168046
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)
Related Items (12)
The green capacitated multi-item lot sizing problem with parallel machines ⋮ Mixed integer programming based heuristics for the patient admission scheduling problem ⋮ Mathematical programming based heuristics for the 0--1 MIP: a survey ⋮ Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem ⋮ A kernel search heuristic for the multivehicle inventory routing problem ⋮ A cash‐constrained dynamic lot‐sizing problem with loss of goodwill and credit‐based loan ⋮ Optimization of the cutting process integrated to the lot sizing in multi-plant paper production industries ⋮ Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing ⋮ Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials ⋮ Worst case analysis of relax and fix heuristics for lot-sizing problems ⋮ Generalized relax-and-fix heuristic ⋮ The multiphase course timetabling problem
Uses Software
Cites Work
- Unnamed Item
- A heuristic solution procedure for the dynamic lot sizing problem with remanufacturing and product recovery
- Heuristics for the multi-item capacitated lot-sizing problem with lost sales
- Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems
- A hybrid multi-population genetic algorithm applied to solve the multi-level capacitated lot sizing problem with backlogging
- Multiple machine continuous setup lotsizing with sequence-dependent setups
- A heuristic approach for big bucket multi-level production planning problems
- Uncapacitated lot sizing with backlogging: the convex hull
- A hybrid optimization approach for multi-level capacitated lot-sizing problems
- Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
- On the polyhedral structure of a multi-item production planning model with setup times
- Hybrid simulated annealing and MIP-based heuristics for stochastic lot-sizing and scheduling problem in capacitated multi-stage production system
- A computational analysis of lower bounds for big bucket production planning problems
- An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging
- A General Heuristic for Production Planning Problems
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
- Uncapacitated lot-sizing: The convex hull of solutions
- 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
- Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
- Heuristics for Multilevel Lot-Sizing with a Bottleneck
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Deterministic Production Planning: Algorithms and Complexity
- Production Planning by Mixed Integer Programming
This page was built for publication: A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems
