Single-point stochastic search algorithms for the multi-level lot-sizing problem
From MaRDI portal
Publication:707016
DOI10.1016/j.cor.2003.09.009zbMath1071.90028OpenAlexW2143766204MaRDI QIDQ707016
Publication date: 9 February 2005
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2003.09.009
Related Items (7)
A MAX-MIN ant system for unconstrained multi-level lot-sizing problems ⋮ A cost-sharing method for the multi-level economic lot-sizing game ⋮ Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials ⋮ A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems ⋮ Solving uncapacitated multilevel lot-sizing problems using a particle swarm optimization with flexible inertial weight ⋮ A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems ⋮ Lot size approximation based on minimising total delay in a shop with multi-assembly products
Cites Work
- Optimization by Simulated Annealing
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
- Multi-level lot-sizing problem: Evaluation of a simulated-annealing heuristic
- Analysis of solution space-dependent performance of simulated annealing: The case of the multi-level capacitated lot sizing problem
- A comparative study of lot sizing procedures for multi-stage assembly systems
- Dynamic Version of the Economic Lot Size Model
- Hybrid heuristics for the multi-stage capacitated lot sizing and loading problem
- Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems
- Optimal Lot-Sizing Algorithms for Complex Product Structures
- 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
- Solving large unconstrained multilevel lot-sizing problems using a hybrid genetic algorithm
- A Tabu Search Heuristic for the Vehicle Routing Problem
- Equation of State Calculations by Fast Computing Machines
- Minimum Concave Cost Flows in Certain Networks
- A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
- Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Single-point stochastic search algorithms for the multi-level lot-sizing problem
