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

570 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Particle Swarm Methods (2018, methodology): “SPV has been successfully combined with PSO in various permutation problems [65, 103, 139, 140].”
A Particle Swarm Optimization-Based Heuristic for Scheduling Workflow Applications in Cloud Computing Environments (2010, unknown): “[17] have provided evidence that PSO algorithm was able to improve 57 out of 90 best known solutions provided by other well known algorithms to solve the sequencing problems.”
A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime (2013, methodology): “…used this test bed to evaluate their algorithms dealing with total or mean flowtime criterion (Liu and Reeves (2001), Li et al. (2006), Li and Wang (2006), Tasgetiren et al. (2007), Jarboui et al. (2009), Dong et al. (2009), Li et al. (2009) and Zhang et al. (2009), possibly among many others).”
A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem (2008, methodology): “[25,27] recently developed a PSO algorithm for the unrestricted permutation flowshop sequencing problem with makespan and total flowtime criteria.”
The distributed permutation flowshop scheduling problem (2010, background): “Davendra (2006), Tasgetiren et al. (2007) and Ruiz and Stutzle (2007), respectively.”