Hybrid Meta-heuristic Algorithm for Task Assignment Problem
محورهای موضوعی : Design of Experiment
Mohammad Jafar Tarokh
1
(Associate Professor, Department of Industrial Engineering, K.N. Toosi University of Technology, Tehran, Iran)
Mehdi Yazdani
2
(Instructor, Department of industrial engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran)
Mani Sharifi
3
(Assistant Professor, Department of industrial engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran)
Mohammad Navid Mokhtarian
4
(PHD Student, Department of industrial engineering, Science and research Branch, Islamic Azad University, Tehran, Iran)
کلید واژه: Task assignment problem, Heterogeneous distributed systems, Hybrid meta-heuristic, Simulated annealing algorithm, Variable neighbourhood search algorithm,
چکیده مقاله :
Task assignment problem (TAP) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. TAP is a combinatorial optimization problem and NP-complete. This paper proposes a hybrid meta-heuristic algorithm for solving TAP in a heterogeneous distributed computing system. To compare our algorithm with previous ones, an extensive computational study on some benchmark problems was conducted. The results obtained from the computational study indicate that the proposed algorithm is a viable and effective approach for the TAP.
