A novel global harmony search algorithm for task assignment problem

  • Authors:

  • Dexuan Zou;Liqun Gao;Steven Li;Jianhua Wu;Xin Wang

  • Affiliations:

  • School of Information Science and Engineering, Northeastern University, Shenyang, Liaoning 110004, PR China;School of Information Science and Engineering, Northeastern University, Shenyang, Liaoning 110004, PR China;Division of Business, University of South Australia, GPO Box 2471, Adelaide, SA 5001, Australia;School of Information Science and Engineering, Northeastern University, Shenyang, Liaoning 110004, PR China;Information and Control Engineering Faculty, Shenyang Jian Zhu University, Shenyang, Liaoning 110168, PR China

  • Venue:
  • Journal of Systems and Software
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

The objective of task assignment problem (TAP) is to minimize the sum of interprocessor communication and task processing costs for a distributed system which subjects to several resource constraints. We use a novel global harmony search algorithm (NGHS) to solve this problem, and the NGHS algorithm has demonstrated higher efficiency than the improved harmony search algorithm (IHS) on finding the near optimal task assignment. We also devise a new method called normalized penalty function method to tradeo^(R) the costs and the constraints. A large number of experiments show that our algorithm performs well on finding the near optimal task assignment, and it is a viable approach for the task assignment problem.