Heuristics for the multi-item capacitated lot-sizing problem with lost sales
From MaRDI portal
(Redirected from Publication:339577)
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
Cites work
- scientific article; zbMATH DE number 3568353 (Why is no real title available?)
- 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
- A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times
- Analysis of relaxations for the multi-item capacitated lot-sizing problem
- Computational Complexity of the Capacitated Lot Size Problem
- Handbook of metaheuristics
- MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
- Modeling industrial lot sizing problems: a review
- On the polyhedral structure of a multi-item production planning model with setup times
- Single item lot sizing problems
- Single item lot-sizing problem for a warm/cold process with immediate lost sales
- Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs
- The multi-item capacitated lot-sizing problem with setup times and shortage costs
- The single-item lot-sizing problem with immediate lost sales
- Uncapacitated lot-sizing problem with production time windows, early productions, backlogs and lost sales
- Validation of subgradient optimization
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
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
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)