Heuristics for the multi-item capacitated lot-sizing problem with lost sales

DOI10.1016/J.COR.2012.06.010zbMath1349.90846OpenAlexW2072670223MaRDI QIDQ339577

Nabil Absi, Boris Detienne, Stéphane Dauzère-Pérès

Publication date: 11 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2012.06.010

zbMATH Keywords

Lagrangian relaxationlost salesadaptive local searchlot-sizingprobing heuristics

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)

Related Items (6)

An effective multi-objective particle swarm optimization for the multi-item capacitated lot-sizing problem with set-up times and backlogging ⋮ Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem ⋮ A cash‐constrained dynamic lot‐sizing problem with loss of goodwill and credit‐based loan ⋮ Planning production and workforce in a discrete-time financial model using scenarios modeling ⋮ A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems ⋮ Workforce planning and financing on a production/capital discrete-time model

Uses Software

• CPLEX
• COIN-OR
• bc-prod

Cites Work

• Unnamed Item
• A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times
• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
• Analysis of relaxations for the multi-item capacitated lot-sizing problem
• The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs
• On the polyhedral structure of a multi-item production planning model with setup times
• The single-item lot-sizing problem with immediate lost sales
• The multi-item capacitated lot-sizing problem with setup times and shortage costs
• Single item lot-sizing problem for a warm/cold process with immediate lost sales
• Single item lot sizing problems
• Uncapacitated lot-sizing problem with production time windows, early productions, backlogs and lost sales
• 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
• A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
• MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Computational Complexity of the Capacitated Lot Size Problem
• Validation of subgradient optimization
• Modeling industrial lot sizing problems: a review
• Handbook of metaheuristics

This page was built for publication: Heuristics for the multi-item capacitated lot-sizing problem with lost sales