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
(Redirected from Publication:339582)
Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems
Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems
Recommendations
- A variable neighborhood decomposition search algorithm for multilevel capacitated lot-sizing problems
- A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems
- A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems
- A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems
- Variable neighborhood formulation search approach for the multi-item capacitated lot-sizing problem with time windows and setup times
- Solving multi-level capacitated lot sizing problems via a fix-and-optimize approach
- A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times
- Variable neighborhood descent heuristic for solving reverse logistics multi-item dynamic lot-sizing problems
Cites work
- An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem
- Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
- General variable neighborhood search for the continuous optimization
- Lot sizing and scheduling -- survey and extensions
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
- Multi-level single machine lot-sizing and scheduling with zero lead times
- Multi-stage simultaneous lot-sizing and scheduling for flow line production
- Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups
- Production Planning by Mixed Integer Programming
- Simultaneous lotsizing and scheduling on parallel machines
- Single and parallel machine capacitated lotsizing and scheduling: new iterative MIP-based neighborhood search heuristics
- Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
- The discrete lot-sizing and scheduling problem with sequence-dependent setup costs
- The double traveling salesman problem with multiple stacks: A variable neighborhood search approach
- The general lotsizing and scheduling problem
- Variable neighborhood decomposition search
- Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems
- Variable neighborhood search for the degree-constrained minimum spanning tree problem
- Variable neighborhood search: Principles and applications
- Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
Cited in
(24)- A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems
- A variable neighborhood decomposition search method for supply chain management planning problems
- Simultaneous lotsizing and scheduling considering secondary resources: a general model, literature review and classification
- A modeling framework and local search solution methodology for a production-distribution problem with supplier selection and time-aggregated quantity discounts
- A variable neighborhood decomposition search algorithm for multilevel capacitated lot-sizing problems
- Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials
- Variable neighborhood search: the power of change and simplicity
- Mixed integer programming based heuristics for the patient admission scheduling problem
- Consistent vehicle routing problem with service level agreements: a case study in the pharmaceutical distribution sector
- Multiple-stage multiple-machine capacitated lot-sizing and scheduling with sequence-dependent setup: a case study in the wheel industry
- Modeling interdependencies in infrastructure systems using multi-layered network flows
- A GLNPSO for multi-level capacitated lot-sizing and scheduling problem in the poultry industry
- Multi‐level, multi‐stage lot‐sizing and scheduling in the flexible flow shop with demand information updating
- A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times
- A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems
- A branch-and-price algorithm for parallel machine campaign planning under sequence dependent family setups and co-production
- Mathematical programming-based approaches for multi-facility Glass container production planning
- Simultaneous lotsizing and scheduling problems: a classification and review of models
- A hybrid genetic algorithm and variable neighborhood search for multi-family capacitated lot-sizing problem
- A variable neighborhood search for multi-family capacitated lot-sizing problem
- Variable neighborhood descent heuristic for solving reverse logistics multi-item dynamic lot-sizing problems
- 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
- A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339582)
