Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm

DOI10.1007/s00500-007-0210-yzbMath1170.90397OpenAlexW1980885057MaRDI QIDQ2476643

Ali Hossein Mirzaei, Alireza Rahimi-Vahed

Publication date: 12 March 2008

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00500-007-0210-y

zbMATH Keywords

Multi-objective genetic algorithmBi-criteria permutation flow shop schedulingMulti-objective shuffled frog-leaping algorithm

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)

Related Items (4)

Evolutionary multiobjective optimization for the multi-machine flow shop scheduling problem under blocking ⋮ An exact algorithm for the bi-objective timing problem ⋮ An effective shuffled frog-leaping algorithm for multi-mode resource-constrained project scheduling problem ⋮ An effective shuffled frog-leaping algorithm for resource-constrained project scheduling problem

Uses Software

• PAES
• SPEA2

Cites Work

• A tabu search approach for the flow shop scheduling problem
• A genetic algorithm for multiple objective sequencing problems in mixed model assembly lines.
• Two-machine flow shop scheduling with two criteria: maximum earliness and makespan
• A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
• A neuro-tabu search heuristic for the flow shop scheduling problem
• A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan
• ``MOSS multiobjective scatter search applied to nonlinear multiple criteria optimization
• Flowshop scheduling research after five decades
• Multiobjective Optimization
• A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times
• Genetic local search for multi-objective combinatorial optimization

This page was built for publication: Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm