GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem

DOI10.1016/j.ejor.2009.01.047zbMath1177.90348OpenAlexW2089811144MaRDI QIDQ1044091

Mauricio G. C. Resende, Mariá C. V. Nascimento, Franklina Maria Bragion 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

zbMATH Keywords

parallel machinesGRASPlot sizingpath-relinkingmulti-plant

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Combinatorial optimization (90C27)

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, Investigation of a new GRASP-based clustering algorithm applied to biological data, Model-based automatic neighborhood design by unsupervised learning, MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration, Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items, 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, A learn‐and‐construct framework for general mixed‐integer programming problems, The robust multi-plant capacitated lot-sizing problem, Optimization of the cutting process integrated to the lot sizing in multi-plant paper production industries, A biased random-key genetic algorithm for data clustering, 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, Lot-sizing for production planning in a recovery system with returns, Memory and Learning in Metaheuristics

Uses Software

• GRASP
• PERL
• Scatter Search
• TTTPLOTS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multilevel capacitated lotsizing complexity and LP-based heuristics
• A probabilistic heuristic for a computationally difficult set covering problem
• Primal-dual approach to the single level capacitated lot-sizing problem
• Capacitated lot-sizing and scheduling by Lagrangean relaxation
• Progress with single-item lot-sizing
• Greedy randomized adaptive search procedures
• Probability distribution of solution time in GRASP: an experimental investigation
• A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers
• Multi-item, multi-facility supply chain planning: Models, complexities, and algorithms
• A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
• TTT plots: a perl program to create time-to-target plots
• A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover
• Economic Lot Scheduling for Multiple Products on Parallel Identical Processors
• A single-product parallel-facilities production-planning model
• A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing
• GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
• An Efficient Algorithm for Multi-Item Scheduling