Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory
From MaRDI portal
Publication:747754
DOI10.1007/S00291-015-0404-0zbMATH Open1326.90024OpenAlexW626368936MaRDI QIDQ747754FDOQ747754
Stèphane Dauzère-Pérès, S. Kedad-Sidhoum, Nabil Absi, Nadjib Brahimi
Publication date: 19 October 2015
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-015-0404-0
Recommendations
- Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation
- A Lagrangian heuristic for capacitated single item lot sizing problems
- A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem
- Two-level lot-sizing with inventory bounds
- Feasible Sequential Decisions and a Flexible Lagrangean‐Based Heuristic for Dynamic Multi‐Level Lot Sizing
- scientific article
- Models and methods for capacitated lot-sizing problems
- Decision horizons for the capacitated lot size model with inventory bounds and stockouts
- Capacitated lot sizing problems with inventory bounds
- An \(O(n^2)\) algorithm for lot sizing with inventory bounds and fixed costs
Numerical optimization and variational techniques (65K10) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Mixed integer programming (90C11) Inventory, storage, reservoirs (90B05) Production models (90B30)
Cites Work
- A review of the joint replenishment problem literature: 1989--2005
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Validation of subgradient optimization
- Computational complexity of uncapacitated multi-echelon production planning problems
- MIP formulations and heuristics for two-level production-transportation problems
- The one-warehouse multi-retailer problem: reformulation, classification, and computational results
- A Constant Approximation Algorithm for the One-Warehouse Multiretailer Problem
- A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands
- Title not available (Why is that?)
- The traveling-salesman problem and minimum spanning trees: Part II
- Uncapacitated two-level lot-sizing
- Lot sizing and scheduling -- survey and extensions
- Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
- Single item lot sizing problems
- Effective Zero-Inventory-Ordering Policies for the Single-Warehouse Multiretailer Problem with Piecewise Linear Cost Structures
- Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
- Economic lot sizing problem with inventory bounds
- Lot-sizing with production and delivery time windows
- Relaxations for two-level multi-item lot-sizing problems
- Bounded Production and Inventory Models with Piecewise Concave Costs
- A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
- Disassembly scheduling: literature review and future research directions
- The discrete lot-sizing and scheduling problem
- Analysis of relaxations for the multi-item capacitated lot-sizing problem
- On the choice of step size in subgradient optimization
- A heuristic for the dynamic multi-level capacitated lotsizing problem with linked lotsizes for general product structures
- A new characterization for the dynamic lot size problem with bounded inventory
- Multi-stage simultaneous lot-sizing and scheduling for flow line production
- Capacitated Multi-Item Lot-Sizing Problems with Time Windows
- Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem
- A note on ``The economic lot sizing problem with inventory bounds
- An \(O(n^2)\) algorithm for lot sizing with inventory bounds and fixed costs
- Dynamic Lot Size Models for Multi-Stage Assembly Systems
- Single‐warehouse multi‐retailer inventory systems with full truckload shipments
Cited In (11)
- Title not available (Why is that?)
- Controlling lead times and minor ordering costs in the joint replenishment problem with stochastic demands under the class of cyclic policies
- Single-item dynamic lot-sizing problems: an updated survey
- An extension of the stochastic joint-replenishment problem under the class of cyclic policies
- Valid inequalities, preprocessing, and an effective heuristic for the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure
- The synchronized and integrated two-level lot sizing and scheduling problem: evaluating the generalized mathematical model
- Integrated lot sizing and blending problems
- Raw material inventory solution in iron and steel industry using Lagrangian relaxation
- Dynamic lot-sizing model under perishability, substitution, and limited storage capacity
- A Lagrangian heuristic for capacitated single item lot sizing problems
- A two-storage multi-item inventory model with hybrid number and nested price discount via hybrid heuristic algorithm
Uses Software
This page was built for publication: Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q747754)
