Solving uncapacitated multilevel lot-sizing problems using a particle swarm optimization with flexible inertial weight
From MaRDI portal
(Redirected from Publication:971702)
Recommendations
- Comparison among three algorithms to solve unconstrained MLLS problems
- Applying particle swarm optimisation to dynamic lot sizing with batch ordering
- An effective multi-objective particle swarm optimization for the multi-item capacitated lot-sizing problem with set-up times and backlogging
- A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems
- A MAX-MIN ant system for unconstrained multi-level lot-sizing problems
Cites work
- scientific article; zbMATH DE number 3739272 (Why is no real title available?)
- scientific article; zbMATH DE number 2159383 (Why is no real title available?)
- A Heuristic for a Resource-capacitated Multi-stage Lot-sizing Problem with Lead Times
- A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
- A MAX-MIN ant system for unconstrained multi-level lot-sizing problems
- An application of swarm optimization to nonlinear programming
- Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems
- Heuristic genetic algorithms for general capacitated lot-sizing problems
- Heuristics for Multilevel Lot-Sizing with a Bottleneck
- Improved Algorithms for Economic Lot Size Problems
- Lot sizing in capacitated production planning and control systems
- Multi-Item Single-Level Capacitated Dynamic Lot-Sizing Heuristics: A General Review
- Multilevel capacitated lotsizing complexity and LP-based heuristics
- Optimal Lot-Sizing Algorithms for Complex Product Structures
- Planning lot sizes and capacity requirements in a single stage production system
- Randomized multi-level lot-sizing heuristics for general product structures.
- Single-point stochastic search algorithms for the multi-level lot-sizing problem
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Solving large unconstrained multilevel lot-sizing problems using a hybrid genetic algorithm
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
Cited in
(14)- A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems
- scientific article; zbMATH DE number 5583359 (Why is no real title available?)
- A novel parallel hybrid intelligence optimization algorithm for a function approximation problem
- Integer linear programming model for multidimensional two-way number partitioning problem
- An effective multi-objective particle swarm optimization for the multi-item capacitated lot-sizing problem with set-up times and backlogging
- Predictive search for capacitated multi-item lot sizing problems
- A GLNPSO for multi-level capacitated lot-sizing and scheduling problem in the poultry industry
- Incorporating a database approach into the large-scale multi-level lot sizing problem
- Comparison among three algorithms to solve unconstrained MLLS problems
- Applying particle swarm optimisation to dynamic lot sizing with batch ordering
- Multi-objective optimization of integrated lot-sizing and scheduling problem in flexible job shops
- Neighborhood search techniques for solving uncapacitated multilevel lot-sizing problems
- A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems
- An improved discrete PSO for tugboat assignment problem under a hybrid scheduling rule in container terminal
This page was built for publication: Solving uncapacitated multilevel lot-sizing problems using a particle swarm optimization with flexible inertial weight
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q971702)
