earticle

논문검색

Independent Task Scheduling by Hybrid Algorithm of Harmony Search and Variable Neighborhood Search

초록

영어

A new hybrid algorithm is proposed in this paper. An independent task scheduling algorithm is designed based on the hybrid algorithm. The hybrid algorithm adopt list scheduling method to code harmony solution and convert harmony vector to priority-based independent task scheduling model, and perform variable neighborhood search on harmony solutions to improve Harmony Search efficiency and solution quality. The simulation results demonstrate that the proposed algorithm can improve the global search abilities and convergence speed and can escape local minimizer to look for better solutions.

목차

Abstract
 1. Introduction
 2. The mathematical model of independent task scheduling
 3. Design of hybrid VNS and HS algorithm for independent taskscheduling
  3.1 The basic principle of VNS and HS
  3.2 The hybrid algorithm of VNS and HS for independent task scheduling
 4. Simulation experiment
 5. Conclusion
 Acknowledgements
 References

저자정보

  • Hua Jiang College of Computer Science, Liaocheng University
  • Liping Zheng College of Computer Science, Liaocheng University
  • Yun Bao College of Computer Science, Liaocheng University
  • Yanxiu Liu College of Computer Science, Liaocheng University

참고문헌

자료제공 : 네이버학술정보

    ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

    0개의 논문이 장바구니에 담겼습니다.