A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Mehmet Fatih Tasgetiren, Yun-Chia Liang, Mehmet Sevkli, Gunes Gencyilmaz. A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. European Journal of Operational Research, 177(3):1930-1947, 2007. [doi]

The following publications are possibly variants of this publication:

Particle Swarm Optimization Algorithm for Permutation Flowshop Sequencing ProblemMehmet Fatih Tasgetiren, Mehmet Sevkli, Yun-Chia Liang, Gunes Gencyilmaz. antsw 2004: 382-389 [doi]

A Discrete Particle Swarm Optimization Algorithm for the Permutation Flowshop Sequencing Problem with Makespan CriterionQuan-ke Pan, Mehmet Fatih Tasgetiren, Yun-Chia Liang. sgai 2007: 19-31 [doi]

runs on WebDSL