A variable neighborhood search for multi-family capacitated lot-sizing problem

DOI10.1016/j.endm.2018.03.016zbMath1408.90341OpenAlexW2797290427MaRDI QIDQ1791929

Adam Stawowy, Jerzy Duda

Publication date: 11 October 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2018.03.016

zbMATH Keywords

linear programminglocal searchproduction planningVNSlot-sizing

Mathematics Subject Classification ID

Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)

Uses Software

• CPLEX

Cites Work

• Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems
• Variable neighborhood search
• A hybrid genetic algorithm and variable neighborhood search for multi-family capacitated lot-sizing problem
• Lot sizing and furnace scheduling in small foundries
• A variable neighborhood decomposition search algorithm for multilevel capacitated lot-sizing problems
• AI and OR in management of operations: history and trends

This page was built for publication: A variable neighborhood search for multi-family capacitated lot-sizing problem