Particle swarm optimization for task assignment problem
By Ayed A. Salman, I. Ahmad, Sabah Al-Madani. Microprocessors and microsystems, 2002
686 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computer Networks and Communications, Information Systems
View Paper: https://www.semanticscholar.org/paper/e1e4ff83ba3985a9ab12ee06a5f6990c21bf1659
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Christian Blum
- Henry Shu-Hung Chung
- Yu-hui Shi
- Jun Zhang
- Xiaodong Li
- Patrick Siarry
- Maoguo Gong
- Qing Cai
In Computer Networks and Communications
- Rajkumar Buyya
- Jun Zhang
- Wei-neng Chen
- Henry Shu-Hung Chung
- Christian Blum
- Maoguo Gong
- Qing Cai
- Patrick Siarry
In Information Systems
- Rajkumar Buyya
- Jun Zhang
- Henry Shu-Hung Chung
- Patrick Siarry
- Mehmet Fatih Tasgetiren
- Anton Beloglazov
- Rodrigo Neves Calheiros
- R. Ranjan
Citations in the corpus
- A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems (2008, background): “[15] have already solved the task assignment problem by the discrete particle swarm optimization but they have just rounded off the values.”
- A Novel Set-Based Particle Swarm Optimization Method for Discrete Optimization Problems (2010, methodology): “The most common space transformation method is to view the position as a priority-based list [6]-[8].”
- A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem (2008, background): “[22], a lot sizing problem by Tasgetiren and Liang [23], a single machine total weighted tardiness problem by Tasgetiren et al.”
- Multiobjective robust optimization method for drawbead design in sheet metal forming (2010, background): “neutral network, pattern recognition, fuzzy system control and other fields [36–41].”
- Swarm Intelligence in Optimization (2008, background): “Traveling salesman problem Onwubolu and Clerc [130] Flowshop scheduling Rameshkumar, Suresh and Mohanasundaram [143] Task assignment Salman, Imtiaz and Al-Madani [150] Neural networks Kennedy, Eberhart, and Shi [92] Mendes, Cortez, Rocha, and Neves [115] Conradie, Miikkulaninen and Aldrich [35] Gudi”
- Complex Network Clustering by Multiobjective Discrete Particle Swarm Optimization Based on Decomposition (2014, methodology): “Based on this idea, some DPSO algorithms characterized by the space transformation technique have been put forward [39], [40].”
- A Particle Swarm Optimization-Based Heuristic for Scheduling Workflow Applications in Cloud Computing Environments (2010, background): “[15] have shown that the performance of PSO algorithm is faster than GA in solving static task assignment problem for homogeneous distributed computing systems based on their test cases.”