Solving large unconstrained multilevel lot-sizing problems using a hybrid genetic algorithm

DOI10.1080/002075400189031MaRDI QIDQ4497310zbMATH OpenOpenAlexFDO

Authors Nico 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

Mathematics Subject Classification ID

Production models (90B30)

Recommendations

• A genetic algorithm for multi-level, multi-machine lot sizing and scheduling
• A parallel genetic algorithm for the multilevel unconstrained lot-sizing problem
• A hybrid multi-population genetic algorithm applied to solve the multi-level capacitated lot sizing problem with backlogging
• The use of genetic algorithms to solve the economic lot size scheduling problem
• scientific article; zbMATH DE number 5583359

Cited in

(27)

• The use of genetic algorithms to solve the economic lot size scheduling problem
• A genetic algorithm for multi-level, multi-machine lot sizing and scheduling
• Heuristic genetic algorithms for general capacitated lot-sizing problems
• A hybrid genetic algorithm and variable neighborhood search for multi-family capacitated lot-sizing problem
• Neighborhood search techniques for solving uncapacitated multilevel 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
• A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems
• Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder
• Infeasibility handling in genetic algorithm using nested domains for production planning
• A constrained multiple raw materials manufacturing batch sizing problem
• A parallel genetic algorithm for the multilevel unconstrained lot-sizing problem
• Applying particle swarm optimisation to dynamic lot sizing with batch ordering
• A memetic algorithm for single-level capacitated lot-sizing problems
• Unequal individual genetic algorithm with intelligent diversification for the lot-scheduling problem in integrated mills using multiple-paper machines
• A hybrid multi-population genetic algorithm applied to solve the multi-level capacitated lot sizing problem with backlogging
• scientific article; zbMATH DE number 5583359 (Why is no real title available?)
• Evolutionary Multi-Criterion Optimization
• Combinatorial optimization and green logistics
• Combinatorial optimization and green logistics
• Incorporating a database approach into the large-scale multi-level lot sizing problem
• Non-permutation flow shop scheduling with order acceptance and weighted tardiness
• Single-point stochastic search algorithms for the multi-level lot-sizing problem
• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
• A MAX-MIN ant system for unconstrained multi-level lot-sizing problems
• Solving uncapacitated multilevel lot-sizing problems using a particle swarm optimization with flexible inertial weight
• Decentralized multi-level uncapacitated lot-sizing by automated negotiation

This page was built for publication: Solving large unconstrained multilevel lot-sizing problems using a hybrid genetic algorithm

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