Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times
From MaRDI portal
Publication:733543
DOI10.1016/j.cor.2009.04.005zbMath1179.90104OpenAlexW2060107668MaRDI QIDQ733543
Nadjib Brahimi, Laurence A. Wolsey, Stéphane Dauzère-Pérès
Publication date: 16 October 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.04.005
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)
Related Items
Pricing for production and delivery flexibility in single-item lot-sizing, A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times, Erratum: a tight formulation for uncapacitated lot-sizing with stock upper bounds, Variable neighborhood formulation search approach for the multi-item capacitated lot-sizing problem with time windows and setup times, MIP Formulations for a Rich Real-World Lot-Sizing Problem with Setup Carryover, A Lagrangian heuristic for capacitated single item lot sizing problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Lagrangean relaxation based heuristics for lot sizing with setup times
- A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times
- Four equivalent lot-sizing models
- A simple heuristic for the multi-item single level capacitated lotsizing problem
- Improved lower bounds for the capacitated lot sizing problem with setup times.
- A solution approach of production planning problems based on compact formulations for single-item lot-sizing models. (Abstract of thesis)
- Lot-sizing with production and delivery time windows
- Approximate extended formulations
- A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover
- A Dynamic Lot-Sizing Model with Demand Time Windows
- Capacitated Multi-Item Lot-Sizing Problems with Time Windows
- A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
- Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
- Improved Algorithms for Economic Lot Size Problems
- Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation
- Dynamic lot‐sizing model with production time windows
