Solving the stochastic dynamic lot-sizing problem through nature-inspired heuristics

DOI10.1016/j.cor.2011.09.004zbMath1251.90034OpenAlexW2156626574MaRDI QIDQ1762143

K. E. Parsopoulos, G. S. Piperagkas, Ioannis Konstantaras, Konstantina Skouri

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.09.004

zbMATH Keywords

differential evolutionparticle swarm optimizationharmony searchdynamic lot-size problemWagner-Whitin algorithm

Mathematics Subject Classification ID

Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)

Related Items (6)

A joint chance-constrained programming approach for the single-item capacitated lot-sizing problem with stochastic demand ⋮ An effective multi-objective particle swarm optimization for the multi-item capacitated lot-sizing problem with set-up times and backlogging ⋮ Stochastic Dual Dynamic Programming for Multiechelon Lot Sizing with Component Substitution ⋮ Minimizing resource consumption on uniform parallel machines with a bound on makespan ⋮ The stochastic lot-sizing problem with quantity discounts ⋮ Single-item dynamic lot-sizing problems: an updated survey

Cites Work

• Novel derivative of harmony search algorithm for discrete design variables
• The particle swarm optimization algorithm: Convergence analysis and parameter selection
• An optimal solution for the stochastic version of the Wagner-Whitin dynamic lot-size model
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• Evolution strategies. A comprehensive introduction
• A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
• A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice
• A survey on problems and methods in generalized assembly line balancing
• Dynamic Version of the Economic Lot Size Model
• Applying particle swarm optimisation to dynamic lot sizing with batch ordering
• Balancing two-sided assembly lines with sequence-dependent setup times
• Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
• A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
• Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
• Improved Algorithms for Economic Lot Size Problems
• Modeling industrial lot sizing problems: a review
• A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach

This page was built for publication: Solving the stochastic dynamic lot-sizing problem through nature-inspired heuristics