MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs
From MaRDI portal
Publication:3598683
Recommendations
- The 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
- An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times
- Heuristics for the multi-item capacitated lot-sizing problem with lost sales
- On alternative mixed integer programming formulations and LP-based heuristics for lot-sizing with setup times
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 general heuristic for production planning problems
- Analysis of relaxations for the multi-item capacitated lot-sizing problem
- Capacitated lot-sizing and scheduling by Lagrangean relaxation
- Computational Complexity of the Capacitated Lot Size Problem
- Deterministic Production Planning: Algorithms and Complexity
- Efficient, Effective Lot Sizing for Multistage Production Systems
- Facets and algorithms for capacitated lot sizing
- 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
- On the polyhedral structure of a multi-item production planning model with setup times
- Single item lot sizing problems
- Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes
- The capacitated lot-sizing problem with linked lot sizes
- The single-item lot-sizing problem with immediate lost sales
- The uncapacitated lot-sizing problem with sales and safety stocks
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
Cited in
(24)- On alternative mixed integer programming formulations and LP-based heuristics for lot-sizing with setup times
- The multi-item capacitated lot-sizing problem with setup times and shortage costs
- Comments on: On a mixture of the fix-and-relax coordination and Lagrangean substitution schemes for multistage stochastic mixed integer programming
- Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials
- An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times
- Mixed integer programming based heuristics for the patient admission scheduling problem
- MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs
- Lot-sizing for production planning in a recovery system with returns
- Single and parallel machine capacitated lotsizing and scheduling: new iterative MIP-based neighborhood search heuristics
- Motivations and analysis of the capacitated lot-sizing problem with setup times and minimum and maximum ending inventories
- Predictive search for capacitated multi-item lot sizing problems
- Using and extending fix-and-relax to solve maritime inventory routing problems
- An \(O(T^{3})\) algorithm for the capacitated lot sizing problem with minimum order quantities
- Grouping in decomposition method for multi-item capacitated lot-sizing problem with immediate lost sales and joint and item-dependent setup cost
- Models and methods for capacitated lot-sizing problems
- A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders
- Heuristics for the multi-item capacitated lot-sizing problem with lost sales
- The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs
- A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times
- On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times
- Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions
- Worst case analysis of relax and fix heuristics for lot-sizing problems
- Efficient algorithms for the joint replenishment problem with minimum order quantities
- Multi-objective optimization of integrated lot-sizing and scheduling problem in flexible job shops
This page was built for publication: MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3598683)
