A parallel genetic algorithm for the multilevel unconstrained lot-sizing problem
From MaRDI portal
Recommendations
- Solving large unconstrained multilevel lot-sizing problems using a hybrid genetic algorithm
- Parallel genetic algorithms with migration for the hybrid flow shop scheduling problem
- Experience with fine-grained parallel genetic algorithms
- scientific article; zbMATH DE number 1041835
- A genetic algorithm for multi-level, multi-machine lot sizing and scheduling
Cited in
(11)- Neighborhood search techniques for solving uncapacitated multilevel lot-sizing problems
- Parallel computational optimization in operations research: a new integrative framework, literature review and research directions
- 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
- A parallel hybrid metaheuristic for bicluster editing
- Unequal individual genetic algorithm with intelligent diversification for the lot-scheduling problem in integrated mills using multiple-paper machines
- Solving large unconstrained multilevel lot-sizing problems using a hybrid genetic algorithm
- Parallel metaheuristics: recent advances and new trends
- scientific article; zbMATH DE number 5583359 (Why is no real title available?)
- Parallel genetic algorithms with migration for the hybrid flow shop scheduling problem
- Decentralized multi-level uncapacitated lot-sizing by automated negotiation
This page was built for publication: A parallel genetic algorithm for the multilevel unconstrained lot-sizing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2900998)
