A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
From MaRDI portal
Publication:2433465
DOI10.1016/j.ejor.2005.06.029zbMath1142.90511MaRDI QIDQ2433465
Franklina Maria Bragion Toledo, Vinicius Amaral Armentano
Publication date: 27 October 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.06.029
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
Combinação de abordagens GLSP e ATSP para o problema de dimensionamento e sequenciamento de lotes de produção de suplementos para nutrição animal, Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines, A learn‐and‐construct framework for general mixed‐integer programming problems, A GLNPSO for multi-level capacitated lot-sizing and scheduling problem in the poultry industry, A genetic algorithm/mathematical programming approach to solve a two-level soft drink production problem, Model-based automatic neighborhood design by unsupervised learning, A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times, Hybrid methods for lot sizing on parallel machines, Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items, Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines, Tabu search with path relinking for an integrated production-distribution problem, Classification and literature review of integrated lot-sizing and cutting stock problems, Research on construction and application for the model of multistage job shop scheduling problem, A coupling cutting stock-lot sizing problem in the paper industry, Solution approaches for the soft drink integrated production lot sizing and scheduling problem, Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants, GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem, The green capacitated multi-item lot sizing problem with parallel machines, MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration, Optimization model for a production, inventory, distribution and routing problem in small furniture companies, A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over, A Lagrangian heuristic for capacitated single item lot sizing problems, Mathematical programming based heuristics for the 0--1 MIP: a survey, MIP Formulations for a Rich Real-World Lot-Sizing Problem with Setup Carryover, Capacitated lot-sizing and scheduling with parallel machines, back-orders, and setup carry-over
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Multilevel capacitated lotsizing complexity and LP-based heuristics
- Primal-dual approach to the single level capacitated lot-sizing problem
- Capacitated lot-sizing and scheduling by Lagrangean relaxation
- Lot sizing and scheduling -- survey and extensions
- Multi-item capacitated lot-sizing by a cross decomposition based algorithm
- Solving mixed integer programming production planning problems with setups by shadow price information.
- Improved lower bounds for the capacitated lot sizing problem with setup times.
- Dynamic Version of the Economic Lot Size Model
- A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover
- Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs
- Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
- 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
- An effective heuristic for the CLSP with set-up times
- Cross decomposition for mixed integer programming
- Validation of subgradient optimization
- An Efficient Algorithm for Multi-Item Scheduling
