A Hybrid Particle Swarm Optimization Algorithm for the Permutation Flowshop Scheduling Problem

DOI10.1007/978-1-4614-5134-1_6zbMath1375.90133OpenAlexW315989021MaRDI QIDQ4596153

Yannis Marinakis, Magdalene Marinaki

Publication date: 30 November 2017

Published in: Optimization Theory, Decision Making, and Operations Research Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4614-5134-1_6

zbMATH Keywords

variable neighborhood searchpath relinkingparticle swarm optimizationpermutation flowshop scheduling problem

Mathematics Subject Classification ID

Hierarchical games (including Stackelberg games) (91A65) Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)

Related Items (1)

Comparison of particle swarm optimization and differential evolution for aggregators’ profit maximization in the demand response system

This page was built for publication: A Hybrid Particle Swarm Optimization Algorithm for the Permutation Flowshop Scheduling Problem