Single-point stochastic search algorithms for the multi-level lot-sizing problem

DOI10.1016/J.COR.2003.09.009MaRDI QIDQ707016zbMATH OpenOpenAlexFDO

Authors Nicolas Jonard, Jully Jeunet

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

Mathematics Subject Classification ID

Stochastic programming (90C15) Inventory, storage, reservoirs (90B05)

Recommendations

• Multi-level lot-sizing problem: Evaluation of a simulated-annealing heuristic
• Randomized multi-level lot-sizing heuristics for general product structures.
• A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems
• Competitive methods for multi-level lot sizing and scheduling: tabu search and randomized regrets
• Statistical search methods for lotsizing problems

Cites work

• scientific article; zbMATH DE number 4048925 (Why is no real title available?)
• scientific article; zbMATH DE number 3737349 (Why is no real title available?)
• scientific article; zbMATH DE number 3739272 (Why is no real title available?)
• scientific article; zbMATH DE number 1050884 (Why is no real title available?)
• A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
• A Tabu Search Heuristic for the Vehicle Routing Problem
• A comparative study of lot sizing procedures for multi-stage assembly systems
• Analysis of solution space-dependent performance of simulated annealing: The case of the multi-level capacitated lot sizing problem
• Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems
• Dynamic Lot Size Models for Multi-Stage Assembly Systems
• Dynamic version of the economic lot size model
• Equation of state calculations by fast computing machines
• Hybrid heuristics for the multi-stage capacitated lot sizing and loading problem
• Improved Heuristics for Multi-Stage Requirements Planning Systems
• Minimum Concave Cost Flows in Certain Networks
• Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems
• Multi-level lot-sizing problem: Evaluation of a simulated-annealing heuristic
• Optimal Lot-Sizing Algorithms for Complex Product Structures
• Optimal Multi-Level Lot Sizing for Requirements Planning Systems
• Optimization by simulated annealing
• Solving large unconstrained multilevel lot-sizing problems using a hybrid genetic algorithm
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing

Cited in

(9)

• A MAX-MIN ant system for unconstrained multi-level lot-sizing problems
• Randomized multi-level lot-sizing heuristics for general product structures.
• 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
• A cost-sharing method for the multi-level economic lot-sizing game
• Lot size approximation based on minimising total delay in a shop with multi-assembly products
• Multi-level lot-sizing problem: Evaluation of a simulated-annealing heuristic
• Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials

This page was built for publication: Single-point stochastic search algorithms for the multi-level lot-sizing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q707016)