A Parallel Genetic Algorithm for the Multilevel Unconstrained Lot-Sizing Problem
From MaRDI portal
Publication:2900998
DOI10.1287/IJOC.1070.0224zbMath1243.90063OpenAlexW2146147257MaRDI QIDQ2900998
Publication date: 28 July 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1070.0224
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (7)
Parallel computational optimization in operations research: a new integrative framework, literature review and research directions ⋮ Parallel metaheuristics: recent advances and new trends ⋮ 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 ⋮ A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems ⋮ Decentralized multi-level uncapacitated lot-sizing by automated negotiation ⋮ A parallel hybrid metaheuristic for bicluster editing
This page was built for publication: A Parallel Genetic Algorithm for the Multilevel Unconstrained Lot-Sizing Problem
