Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems
From MaRDI portal
Publication:339582
DOI10.1016/j.cor.2012.07.002zbMath1349.90046OpenAlexW2074989399MaRDI QIDQ339582
Herbert Meyr, Bernardo Almada-Lobo, Florian Seeanner
Publication date: 11 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.07.002
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)
Related Items
Multiple-stage multiple-machine capacitated lot-sizing and scheduling with sequence-dependent setup: a case study in the wheel industry ⋮ Simultaneous lotsizing and scheduling problems: a classification and review of models ⋮ A GLNPSO for multi-level capacitated lot-sizing and scheduling problem in the poultry industry ⋮ Mixed integer programming based heuristics for the patient admission scheduling problem ⋮ Mathematical programming-based approaches for multi-facility Glass container production planning ⋮ A branch-and-price algorithm for parallel machine campaign planning under sequence dependent family setups and co-production ⋮ A hybrid genetic algorithm and variable neighborhood search for multi-family capacitated lot-sizing problem ⋮ Multi‐level, multi‐stage lot‐sizing and scheduling in the flexible flow shop with demand information updating ⋮ Variable neighborhood search: the power of change and simplicity ⋮ Simultaneous lotsizing and scheduling considering secondary resources: a general model, literature review and classification ⋮ Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials ⋮ Consistent vehicle routing problem with service level agreements: a case study in the pharmaceutical distribution sector ⋮ A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems ⋮ A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems ⋮ A variable neighborhood search for multi-family capacitated lot-sizing problem ⋮ Modeling interdependencies in infrastructure systems using multi-layered network flows ⋮ A modeling framework and local search solution methodology for a production-distribution problem with supplier selection and time-aggregated quantity discounts ⋮ Multi-objective optimization of integrated lot-sizing and scheduling problem in flexible job shops ⋮ A decomposition approach for the general lotsizing and scheduling problem for parallel production lines
Uses Software
Cites Work
- Single and parallel machine capacitated lotsizing and scheduling: new iterative MIP-based neighborhood search heuristics
- Multi-level single machine lot-sizing and scheduling with zero lead times
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
- General variable neighborhood search for the continuous optimization
- An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem
- Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems
- Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
- The double traveling salesman problem with multiple stacks: A variable neighborhood search approach
- Lot sizing and scheduling -- survey and extensions
- The discrete lot-sizing and scheduling problem with sequence-dependent setup costs
- Variable neighborhood search for the degree-constrained minimum spanning tree problem
- The general lotsizing and scheduling problem
- Simultaneous lotsizing and scheduling on parallel machines
- Variable neighborhood decomposition search
- Multi-stage simultaneous lot-sizing and scheduling for flow line production
- Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
- Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
- Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups
- Production Planning by Mixed Integer Programming
- Variable neighborhood search: Principles and applications
This page was built for publication: Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems
