A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over
From MaRDI portal
Publication:1782152
DOI10.1016/j.cor.2018.07.008zbMath1458.90227OpenAlexW2884419211MaRDI QIDQ1782152
Desiree M. Carvalho, Mariá C. V. Nascimento
Publication date: 18 September 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2018.07.008
Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Inventory, storage, reservoirs (90B05)
Related Items
On the computational complexity of uncapacitated multi-plant lot-sizing problems, The heterogeneous flexible periodic vehicle routing problem: mathematical formulations and solution algorithms, Optimal selection of touristic packages based on user preferences during sports mega-events, A kernel search heuristic for the multivehicle inventory routing problem, A matheuristic for the electric vehicle routing problem with time windows and a realistic energy consumption model, The robust multi-plant capacitated lot-sizing problem, The setup carryover assignment problem, Optimization of the cutting process integrated to the lot sizing in multi-plant paper production industries, Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup
Uses Software
Cites Work
- Unnamed Item
- Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items
- Single and parallel machine capacitated lotsizing and scheduling: new iterative MIP-based neighborhood search heuristics
- Analysis of relaxations for the multi-item capacitated lot-sizing problem
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
- GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem
- Lotsizing and scheduling for production planning
- An expanding-core algorithm for the exact \(0-1\) knapsack problem
- New trends in exact algorithms for the \(0-1\) knapsack problem
- 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
- Core Problems in Knapsack Algorithms
- A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover
- The Capacitated Lot-Sizing Problem with Linked Lot Sizes
- Capacitated lot-sizing and scheduling with parallel machines, back-orders, and setup carry-over
- Optimal Lot-Sizing Algorithms for Complex Product Structures
- An Algorithm for Large Zero-One Knapsack Problems
- Computational Complexity of the Capacitated Lot Size Problem
- A Dual Ascent and Column Generation Heuristic for the Discrete Lotsizing and Scheduling Problem with Setup Times
- A framework for modelling setup carryover in the capacitated lot sizing problem
- Validation of subgradient optimization
- Minimum Change-Over Scheduling of Several Products on One Machine
- An Efficient Algorithm for Multi-Item Scheduling
- Benchmarking optimization software with performance profiles.
