Genetic algorithms with different representation schemes for complex hybrid flexible flow line problems
From MaRDI portal
Publication:537990
DOI10.1504/IJMHEUR.2010.033122zbMath1219.90069OpenAlexW2138769212MaRDI QIDQ537990
Thijs Urlings, Rubén Ruiz, Funda Sivrikaya-Serifoglu
Publication date: 23 May 2011
Published in: International Journal of Metaheuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1504/ijmheur.2010.033122
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (5)
Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows ⋮ A parameter-less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows ⋮ An MO‐GVNS algorithm for solving a multiobjective hybrid flow shop scheduling problem ⋮ A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility ⋮ Shifting representation search for hybrid flexible flowline problems
This page was built for publication: Genetic algorithms with different representation schemes for complex hybrid flexible flow line problems
