MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs
From MaRDI portal
Publication:3598683
DOI10.1051/RO:2007014zbMath1190.90062OpenAlexW2148969754MaRDI QIDQ3598683
Nabil Absi, Safia Kedad-Sidhoum
Publication date: 3 February 2009
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=RO_2007__41_2_171_0/
setup timemixed integer programmingproduction planningheuristiclot-sizingshortage costsafety stock deficit
Related Items (21)
Comments on: On a mixture of the fix-and-relax coordination and Lagrangean substitution schemes for multistage stochastic mixed integer programming ⋮ Motivations and analysis of the capacitated lot-sizing problem with setup times and minimum and maximum ending inventories ⋮ A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders ⋮ Mixed integer programming based heuristics for the patient admission scheduling problem ⋮ Heuristics for the multi-item capacitated lot-sizing problem with lost sales ⋮ Using and extending fix-and-relax to solve maritime inventory routing problems ⋮ Predictive Search for Capacitated Multi-Item Lot Sizing Problems ⋮ Efficient algorithms for the joint replenishment problem with minimum order quantities ⋮ An \(O(T^{3})\) algorithm for the capacitated lot sizing problem with minimum order quantities ⋮ Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions ⋮ Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials ⋮ The multi-item capacitated lot-sizing problem with setup times and shortage costs ⋮ On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times ⋮ An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times ⋮ Single and parallel machine capacitated lotsizing and scheduling: new iterative MIP-based neighborhood search heuristics ⋮ MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs ⋮ The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs ⋮ Multi-objective optimization of integrated lot-sizing and scheduling problem in flexible job shops ⋮ Worst case analysis of relax and fix heuristics for lot-sizing problems ⋮ Models and methods for capacitated lot-sizing problems ⋮ Lot-sizing for production planning in a recovery system with returns
Uses Software
Cites Work
- Unnamed Item
- Analysis of relaxations for the multi-item capacitated lot-sizing problem
- Capacitated lot-sizing and scheduling by Lagrangean relaxation
- On the polyhedral structure of a multi-item production planning model with setup times
- Facets and algorithms for capacitated lot sizing
- The single-item lot-sizing problem with immediate lost sales
- Single item lot sizing problems
- A General Heuristic for Production Planning Problems
- The Capacitated Lot-Sizing Problem with Linked Lot Sizes
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
- A Forward Algorithm for the Capacitated Lot Size Model with Stockouts
- Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes
- 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
- Deterministic Production Planning: Algorithms and Complexity
- Computational Complexity of the Capacitated Lot Size Problem
- Efficient, Effective Lot Sizing for Multistage Production Systems
- The uncapacitated lot-sizing problem with sales and safety stocks
This page was built for publication: MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs
