Neighborhood search techniques for solving uncapacitated multilevel lot-sizing problems
From MaRDI portal
Publication:1762018
DOI10.1016/J.COR.2011.06.004zbMATH Open1251.90043OpenAlexW2029468420MaRDI QIDQ1762018FDOQ1762018
Yi-Yong Xiao, Qiu-Hong Zhao, Ren-Qian Zhang, Ikou Kaku
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.06.004
Recommendations
- 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 variable neighborhood search for multi-family capacitated lot-sizing problem
- A variable neighborhood decomposition search algorithm for multilevel capacitated lot-sizing problems
- Neighborhood search heuristics for the uncapacitated facility location problem
- Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups
- Multilayer variable neighborhood search for two-level uncapacitated facility location problems with single assignment
- Optimization-based very large-scale neighborhood search for generalized assignment problems with location/allocation considerations
- Uncapacitated lot-sizing: The convex hull of solutions
indexmeta-heuristic algorithmcomparative simulationsmultilevel lot-sizing (MLLS) problemneighborhood search techniques
Cites Work
- Variable neighborhood search
- A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
- Variable neighborhood search: Principles and applications
- A MAX-MIN ant system for unconstrained multi-level lot-sizing problems
- Minimum Concave Cost Flows in Certain Networks
- A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems
- A parallel genetic algorithm for the multilevel unconstrained lot-sizing problem
- Solving large unconstrained multilevel lot-sizing problems using a hybrid genetic algorithm
- Optimal Lot-Sizing Algorithms for Complex Product Structures
- Solving uncapacitated multilevel lot-sizing problems using a particle swarm optimization with flexible inertial weight
- Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems
- Optimal Multi-Level Lot Sizing for Requirements Planning Systems
- Improved Heuristics for Multi-Stage Requirements Planning Systems
- Dynamic Lot Size Models for Multi-Stage Assembly Systems
- Decentralized multi-level uncapacitated lot-sizing by automated negotiation
- An evaluation of heuristic performance in multi-stage lot-sizing systems
Cited In (8)
- A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems
- A variable neighborhood decomposition search algorithm for multilevel capacitated lot-sizing problems
- Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups
- Workforce planning and financing on a production/capital discrete-time model
- Modeling and solving the constrained multi-items lot-sizing problem with time-varying setup cost
- Optimizing frequent time-window selection for association rules mining in a temporal database using a variable neighbourhood search
- Combining very large scale and ILP based neighborhoods for a two-level location problem
- A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems
This page was built for publication: Neighborhood search techniques for solving uncapacitated multilevel lot-sizing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1762018)
