Efficient reformulations for dynamic lot-sizing problems with product substitution
From MaRDI portal
Publication:2379664
DOI10.1007/s00291-008-0148-1zbMath1183.90148OpenAlexW2024768281MaRDI QIDQ2379664
Jan Christian Lang, Wolfgang Domschke
Publication date: 19 March 2010
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-008-0148-1
mixed-integer programmingproduct substitutionreformulationslot-sizingapproximate extended formulations
Related Items (9)
A classification of the literature on the planning of substitutable products ⋮ Stochastic Dual Dynamic Programming for Multiechelon Lot Sizing with Component Substitution ⋮ Heuristic approach on dynamic lot-sizing model for durable products with end-of-use constraints ⋮ OREX-J: Towards a universal software framework for the experimental analysis of optimization algorithms ⋮ Dynamic lot-sizing model under perishability, substitution, and limited storage capacity ⋮ Integrated lot sizing and blending problems ⋮ Efficient approximate algorithms for a class of dynamic lot size problems under product substitution ⋮ Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions ⋮ Forecast horizon for dynamic lot sizing model under product substitution and perishable inventories
Cites Work
- Unnamed Item
- Multilevel capacitated lotsizing complexity and LP-based heuristics
- Evaluation of inventory policies with unidirectional substitutions
- Supplier selection and order lot sizing modeling: a review
- Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing
- Reformulations of the shortest route model for dynamic multi-item multi-level capacitated lotsizing
- The capacitated plant location problem
- Strong formulations for mixed integer programs: valid inequalities and extended formulations
- An improved heuristic for deciding on emergency transshipments.
- Approximate extended formulations
- A Few Remarks on the Assortment Problem
- Random Yield and Random Demand in a Production System with Downward Substitution
- Single-Period Multiproduct Inventory Models with Substitution
- Dynamic Capacity Management with Substitution
- Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs
- Standardisation of substitutable electrical items
- On alternative mixed integer programming formulations and LP-based heuristics for lot-sizing with setup times
- Production Planning with Flexible Product Specifications: An Application to Specialty Steel Manufacturing
- Overbooking with Substitutable Inventory Classes
- The Discrete Two-Dimensional Assortment Problem
- A Dual-Based Procedure for Uncapacitated Facility Location
- Ordering Policies in an environment of Stochastic Yields and Substitutable Demands
- LP-based heuristics for the capacitated lot-sizing problem: The interaction of model formulation and solution algorithm
- Specially Structured Uncapacitated Facility Location Problems
- Modelling replenishment and transshipment decisions in periodic review multilocation inventory systems
- Production Planning by Mixed Integer Programming
This page was built for publication: Efficient reformulations for dynamic lot-sizing problems with product substitution
