GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem
From MaRDI portal
Publication:1044091
DOI10.1016/J.EJOR.2009.01.047zbMATH Open1177.90348OpenAlexW2089811144MaRDI QIDQ1044091FDOQ1044091
Authors: Mariá C. V. Nascimento, Mauricio G. C. Resende, Franklina M. B. Toledo 
Publication date: 10 December 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2009.01.047
Recommendations
- A heuristic procedure for solving multi-plant, multi-item, multi-period capacitated lot-sizing problems
- Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items
- A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers
- Lagrangean heuristic for a multi-plant lot-sizing problem with transfer and storage capacities
- A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Production models (90B30)
Cites Work
- A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers
- GRASP: An annoted bibliography
- Title not available (Why is that?)
- A probabilistic heuristic for a computationally difficult set covering problem
- Greedy randomized adaptive search procedures
- Capacitated lot-sizing and scheduling by Lagrangean relaxation
- Probability distribution of solution time in GRASP: an experimental investigation
- A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
- TTT plots: a perl program to create time-to-target plots
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- A tabu-search heuristic for the capacitated lot-sizing problem with set-up carryover
- Multilevel capacitated lotsizing complexity and LP-based heuristics
- Progress with single-item lot-sizing
- Economic Lot Scheduling for Multiple Products on Parallel Identical Processors
- A heuristic procedure for solving multi-plant, multi-item, multi-period capacitated lot-sizing problems
- A single-product parallel-facilities production-planning model
- An Efficient Algorithm for Multi-Item Scheduling
- Primal-dual approach to the single level capacitated lot-sizing problem
- A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing
- Multi-item, multi-facility supply chain planning: Models, complexities, and algorithms
Cited In (16)
- Investigation of a new GRASP-based clustering algorithm applied to biological data
- On the computational complexity of uncapacitated multi-plant lot-sizing problems
- A biased random-key genetic algorithm for data clustering
- A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over
- Lot-sizing for production planning in a recovery system with returns
- The robust multi-plant capacitated lot-sizing problem
- An effective heuristic for multi-period multi-foodgrain inventory transportation problem in India
- Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items
- A learn‐and‐construct framework for general mixed‐integer programming problems
- MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration
- Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup
- Model-based automatic neighborhood design by unsupervised learning
- The synchronized and integrated two-level lot sizing and scheduling problem: evaluating the generalized mathematical model
- Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem
- Optimization of the cutting process integrated to the lot sizing in multi-plant paper production industries
- Memory and learning in metaheuristics
Uses Software
This page was built for publication: GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1044091)
