Solving large unconstrained multilevel lot-sizing problems using a hybrid genetic algorithm
From MaRDI portal
Publication:4497310
DOI10.1080/002075400189031zbMath0945.90533OpenAlexW2097981226MaRDI QIDQ4497310
Nico P. Dellaert, Jully Jeunet
Publication date: 22 August 2000
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/002075400189031
Related Items (16)
Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches ⋮ Unequal individual genetic algorithm with intelligent diversification for the lot-scheduling problem in integrated mills using multiple-paper machines ⋮ A MAX-MIN ant system for unconstrained multi-level lot-sizing problems ⋮ Incorporating a database approach into the large-scale multi-level lot sizing problem ⋮ Non-permutation flow shop scheduling with order acceptance and weighted tardiness ⋮ Combinatorial optimization and green logistics ⋮ A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems ⋮ Neighborhood search techniques for solving uncapacitated multilevel lot-sizing problems ⋮ Solving uncapacitated multilevel lot-sizing problems using a particle swarm optimization with flexible inertial weight ⋮ Single-point stochastic search algorithms for the multi-level lot-sizing problem ⋮ Combinatorial optimization and green logistics ⋮ A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems ⋮ Applying particle swarm optimisation to dynamic lot sizing with batch ordering ⋮ Decentralized multi-level uncapacitated lot-sizing by automated negotiation ⋮ Randomized multi-level lot-sizing heuristics for general product structures. ⋮ Heuristic genetic algorithms for general capacitated lot-sizing problems
This page was built for publication: Solving large unconstrained multilevel lot-sizing problems using a hybrid genetic algorithm
