Analysis of relaxations for the multi-item capacitated lot-sizing problem
From MaRDI portal
Publication:922259
DOI10.1007/BF02248584zbMath0709.90030OpenAlexW2091212366MaRDI QIDQ922259
Publication date: 1990
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02248584
Lagrangian relaxationcolumn generationcomputational comparisonsubgradient optimizationmulti-item capacitated lot-sizing
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Inventory, storage, reservoirs (90B05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Production allocation with dual provisioning, Solving large-scale profit maximization capacitated lot-size problems by heuristic methods, A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers, Dynamic capacitated lot-sizing problems: a classification and review of solution approaches, An effective multi-objective particle swarm optimization for the multi-item capacitated lot-sizing problem with set-up times and backlogging, A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem, A genetic algorithm/mathematical programming approach to solve a two-level soft drink production problem, Heuristics for the multi-item capacitated lot-sizing problem with lost sales, Large-scale joint price-inventory decision problems, under resource limitation and a discrete price set, Capacitated replenishment and disposal planning for multiple products with resalable returns, The synchronized and integrated two-level lot sizing and scheduling problem: evaluating the generalized mathematical model, Just-in-Time Planning and Lot-Sizing, Modèle linéaire mixte et heuristique pour un réseau de distribution à deux échelons pour des produits périssables, Improved lower bounds for the capacitated lot sizing problem with setup times., Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines, Capacitated lot sizing problems with inventory bounds, The multi-item capacitated lot-sizing problem with setup times and shortage costs, Lagrangean relaxation based heuristics for lot sizing with setup times, Multi-level multi-item lot size planning with limited resources and general manufacturing structure., Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case, Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company, Multi-item uncapacitated lot sizing problem with inventory bounds, DLSP for two-stage multi-item batch production, MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs, A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over, Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times, Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory, Unnamed Item, The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs, Models and methods for capacitated lot-sizing problems, Lot sizing and scheduling -- survey and extensions, Analysis of solution space-dependent performance of simulated annealing: The case of the multi-level capacitated lot sizing problem, The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability, Single item lot sizing problems, A Lagrangian heuristic for capacitated single item lot sizing problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of lower bounding methodologies for production/inventory models
- Facility location models for distribution planning
- Finiteness in restricted simplicial decomposition
- Lot-size models with backlogging: Strong reformulations and cutting planes
- Generalized upper bounding techniques
- Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems
- Dynamic Version of the Economic Lot Size Model
- Projected Newton methods and optimization of multicommodity flows
- Analysis Of Lagrangian Decomposition For The Multi-Item Capacitated Lot-Sizing Problem
- A cyclical scheduling heuristic for lot sizing with capacity constraints
- The Multi-Item Capacitated Lot Size Problem: Error Bounds of Manne's Formulations
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Deterministic Production Planning: Algorithms and Complexity
- Technical Note—Computational Comparison among Three Multicommodity Network Flow Algorithms
- Multi-Stage Production Planning
- Using Lagrangean Techniques to Solve Hierarchical Production Planning Problems
- Computational Complexity of the Capacitated Lot Size Problem
- A Lower Bounding Structure for Lot-Size Scheduling Problems
- Multicommodity Distribution System Design by Benders Decomposition
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Simplicial decomposition in nonlinear programming algorithms
- A Survey of Linear Cost Multicommodity Network Flows
- `` Strong NP-Completeness Results
- An extension of the frank and Wolfe method of feasible directions
- Validation of subgradient optimization
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- Production Scheduling by the Transportation Method of Linear Programming
- A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
- An Efficient Algorithm for Multi-Item Scheduling
- Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm
