Skip to main content

Independent Task Scheduling Based on Improved Harmony Search Algorithm

  • Conference paper
Advances in Swarm Intelligence (ICSI 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7332))

Included in the following conference series:

  • 2111 Accesses

Abstract

Harmony Search Algorithm (HS) is a novel global heuristic algorithm with the characteristic of good robustness and quick convergence, it is also an effective algorithm to solve combinatorial problems. After the basic theory of HS is introduced, an independent task scheduling of multiprocessors algorithm based on an improved harmony search algorithm is proposed in this paper. The mechanisms involved are employing list scheduling and harmony vector is converted to priority-based scheduling model. The simulation results demonstrate that the proposed algorithm improves the abilities of seeking the global search and evolution speed, and the effect of simulation is satisfactory.

Liaocheng University Research Project Foundation. (X10018). Shandong Province Higher Educational Science and Technology Project(J11LG02)

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Sinnen, O., Sousa, L.A., Sandnes, F.E.: Toward a realistic task scheduling model. IEEE Transactions on Parallel and Distributed Systems 17, 263–275 (2006)

    Article  Google Scholar 

  2. Geem, Z., Kim, J., Loganathan, G.: A new heuristic optimization algorithm: harmony search. Simulation 76, 60–68 (2001)

    Article  Google Scholar 

  3. Geem, Z.: Optimal cost design of water distribution networks using harmony search. Engineering Optimization 38, 259–280 (2006)

    Article  Google Scholar 

  4. Geem, Z., Kim, J., Loganathan, G.: A new heuristic optimization: application to pipe network design. International Journal of Model Simulation 22, 125–133 (2002)

    Google Scholar 

  5. Kim, J., Geem, Z., Kim, E.: Parameter estimation of the nonlinear Muskingum model using harmony search. Journal of American Water Resource Association 37, 1131–1138 (2001)

    Article  Google Scholar 

  6. Shang, G., Jingyu, Y.: Solving Multiprocessor Scheduling Problem by Particle Swarm Optimization Algorithm. Computer Engineering and Appiication 41, 72–73 (2005)

    Google Scholar 

  7. Mahdavi, M., Fesanghary, M., Damangir, E.: An improved harmony search algorithm for solving optimization problems. Applied Mathematics and Computation 188, 1567–1579 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  8. Omran, M.G.H., Mahdavi, M.: Global-best harmony search Applied. Mathematics and Computation 198, 643–656 (2008)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jiang, H., Zheng, L., Liu, Y. (2012). Independent Task Scheduling Based on Improved Harmony Search Algorithm. In: Tan, Y., Shi, Y., Ji, Z. (eds) Advances in Swarm Intelligence. ICSI 2012. Lecture Notes in Computer Science, vol 7332. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31020-1_44

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31020-1_44

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31019-5

  • Online ISBN: 978-3-642-31020-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics