Heuristics for the multi-item capacitated lot-sizing problem with lost sales
From MaRDI portal
Publication:339577
DOI10.1016/J.COR.2012.06.010zbMATH Open1349.90846OpenAlexW2072670223MaRDI QIDQ339577FDOQ339577
Authors: 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
Recommendations
- MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs
- Multi-Item Single-Level Capacitated Dynamic Lot-Sizing Heuristics: A General Review
- The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs
- A Lagrangian heuristic for capacitated single item lot sizing problems
- The single-item lot-sizing problem with immediate lost sales
Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)
Cites Work
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Validation of subgradient optimization
- Handbook of metaheuristics
- Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes
- Single item lot sizing problems
- Title not available (Why is that?)
- Modeling industrial lot sizing problems: a review
- The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs
- Computational Complexity of the Capacitated Lot Size Problem
- Analysis of relaxations for the multi-item capacitated lot-sizing problem
- The single-item lot-sizing problem with immediate lost sales
- The multi-item capacitated lot-sizing problem with setup times and shortage costs
- A Forward Algorithm for the Capacitated Lot Size Model with Stockouts
- A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
- On the polyhedral structure of a multi-item production planning model with setup times
- Single item lot-sizing problem for a warm/cold process with immediate lost sales
- 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
- MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs
- A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times
Cited In (11)
- Loss of customer goodwill in the uncapacitated lot-sizing problem
- An effective multi-objective particle swarm optimization for the multi-item capacitated lot-sizing problem with set-up times and backlogging
- MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs
- Workforce planning and financing on a production/capital discrete-time model
- Grouping in decomposition method for multi-item capacitated lot-sizing problem with immediate lost sales and joint and item-dependent setup cost
- Lot sizing with bounded inventory and lost sales
- A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems
- Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem
- Planning production and workforce in a discrete-time financial model using scenarios modeling
- A cash‐constrained dynamic lot‐sizing problem with loss of goodwill and credit‐based loan
- The single-item lot-sizing problem with immediate lost sales
Uses Software
This page was built for publication: Heuristics for the multi-item capacitated lot-sizing problem with lost sales
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339577)
