Hybrid Meta-heuristic Algorithm for Task Assignment Problem

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.

[1]  David Fernández-Baca,et al.  Parametric Module Allocation on Partial k-Trees , 1993, IEEE Trans. Computers.

[2]  Ching-Chi Hsu,et al.  Task assignment scheduling by simulated annealing , 1990, IEEE TENCON'90: 1990 IEEE Region 10 Conference on Computer and Communication Systems. Conference Proceedings.

[3]  Yskandar Hamam,et al.  Assignment of program modules to processors: A simulated annealing approach , 2000, Eur. J. Oper. Res..

[4]  Xin Yao,et al.  Hybrid meta-heuristics algorithms for task assignment in heterogeneous computing systems , 2006, Comput. Oper. Res..

[5]  Mostafa Zandieh,et al.  A variable neighbourhood search algorithm for the flexible job-shop scheduling problem , 2010 .

[6]  Harold S. Stone,et al.  Multiprocessor Scheduling with the Aid of Network Flow Algorithms , 1977, IEEE Transactions on Software Engineering.

[7]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[8]  Sung-Bong Yang,et al.  Task scheduling in distributed computing systems with a genetic algorithm , 1997, Proceedings High Performance Computing on the Information Superhighway. HPC Asia '97.

[9]  Mostafa Zandieh,et al.  Flexible job-shop scheduling with parallel variable neighborhood search algorithm , 2010, Expert Syst. Appl..

[10]  Katta G. Murty,et al.  A hybrid genetic/optimization algorithm for a task allocation problem , 1999 .

[11]  Benjamin B. M. Shao,et al.  Metaheuristic Algorithms for Task Assignment in Distributed Computing Systems : A Comparative and Integrative Approach , 2009 .

[12]  Gen-Huey Chen,et al.  A branch-and-bound-with-underestimates algorithm for the task assignment problem with precedence constraint , 1990, Proceedings.,10th International Conference on Distributed Computing Systems.

[13]  Alain Billionnet,et al.  An efficient algorithm for a task allocation problem , 1992, JACM.

[14]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[15]  Amaia Lusa,et al.  A variable neighbourhood search algorithm for the constrained task allocation problem , 2008, J. Oper. Res. Soc..

[16]  M. Zandieh,et al.  A Simulated Annealing Algorithm for Flexible Job-Shop Scheduling Problem , 2009 .

[17]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[18]  Lamberto Cesari,et al.  Optimization-Theory And Applications , 1983 .

[19]  Peng-Yeng Yin,et al.  A hybrid particle swarm optimization algorithm for optimal task assignment in distributed systems , 2006, Comput. Stand. Interfaces.

[20]  Anil Kumar Tripathi,et al.  A GA Based Multiple Task Allocation Considering Load , 2000, Int. J. High Speed Comput..

[21]  Ishfaq Ahmad,et al.  Optimal task assignment in heterogeneous distributed computing systems , 1998, IEEE Concurr..

[22]  Kang G. Shin,et al.  Optimal Task Assignment in Homogeneous Networks , 1997, IEEE Trans. Parallel Distributed Syst..

[23]  S. Dreyfus,et al.  Thermodynamical Approach to the Traveling Salesman Problem : An Efficient Simulation Algorithm , 2004 .

[24]  Dexuan Zou,et al.  An improved differential evolution algorithm for the task assignment problem , 2011, Eng. Appl. Artif. Intell..

[25]  E.-G. Talbi,et al.  Hill-climbing, simulated annealing and genetic algorithms: a comparative study and application to the mapping problem , 1993, [1993] Proceedings of the Twenty-sixth Hawaii International Conference on System Sciences.

[26]  Tarek A. El-Ghazawi,et al.  A Parallel Genetic Algorithm for Task Mapping on Parallel Machines , 1999, IPPS/SPDP Workshops.

[27]  Jozef Kratica,et al.  Solving the Task Assignment Problem with a Variable Neighborhood Search , 2011, Serdica Journal of Computing.

[28]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[29]  Shinn-Ying Ho,et al.  OPSO: Orthogonal Particle Swarm Optimization and Its Application to Task Assignment Problems , 2008, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[30]  Imtiaz Ahmad,et al.  Particle swarm optimization for task assignment problem , 2002, Microprocess. Microsystems.

[31]  Mehdi Seifbarghy,et al.  Maximal Benefit Location Problem for A Congested System , 2010 .