Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items
From MaRDI portal
Publication:342353
DOI10.1016/j.cor.2016.01.019zbMath1349.90014OpenAlexW2252440427MaRDI QIDQ342353
Mariá C. V. Nascimento, Desiree M. Carvalho
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2016.01.019
Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Inventory, storage, reservoirs (90B05)
Related Items
An effective heuristic for multi-period multi-foodgrain inventory transportation problem in India, On the computational complexity of uncapacitated multi-plant lot-sizing problems, A knowledge-based approach for multi-factory production systems, Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection, The robust multi-plant capacitated lot-sizing problem, Optimization of the cutting process integrated to the lot sizing in multi-plant paper production industries, Unnamed Item, Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup, A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over, OPTIMAL LOT-SIZING DECISIONS WITH INTEGRATED PURCHASING, MANUFACTURING AND ASSEMBLING FOR REMANUFACTURING SYSTEMS
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem
- A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders
- A genetic algorithm/mathematical programming approach to solve a two-level soft drink production problem
- A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times
- Multilevel capacitated lotsizing complexity and LP-based heuristics
- Solution approaches for the soft drink integrated production lot sizing and scheduling problem
- GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem
- Lot sizing and scheduling -- survey and extensions
- A knapsack problem as a tool to solve the production planning problem in small foundries
- A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers
- A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
- Lot sizing and furnace scheduling in small foundries
- Dynamic Version of the Economic Lot Size Model
- A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover
- A single-product parallel-facilities production-planning model
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- A Dual-Based Procedure for Uncapacitated Facility Location
- Validation of subgradient optimization
- Benchmarking optimization software with performance profiles.
