On the Effectiveness of Particle Swarm Optimization and Variable Neighborhood Descent for the Continuous Flow-Shop Scheduling Problem

DOI10.1007/978-3-540-78985-7_3zbMath1151.90402OpenAlexW1486632910MaRDI QIDQ5302315

Andreas Fink, Jens Czogalla

Publication date: 7 January 2009

Published in: Metaheuristics for Scheduling in Industrial and Manufacturing Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78985-7_3

zbMATH Keywords

genetic operatorsvariable neighborhood descenthybridizationparticle swarm optimizationflow-shop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (5)

An Improved Genetic Algorithm for the Resource-Constrained Project Scheduling Problem ⋮ A survey of scheduling problems with no-wait in process ⋮ Fitness landscape analysis for the no-wait flow-shop scheduling problem ⋮ Variable neighbourhood search: methods and applications ⋮ Variable neighbourhood search: Methods and applications

This page was built for publication: On the Effectiveness of Particle Swarm Optimization and Variable Neighborhood Descent for the Continuous Flow-Shop Scheduling Problem