Skip to main content

A Heuristic-Based Bee Colony Algorithm for the Multiprocessor Scheduling Problem

  • Chapter
Nature Inspired Cooperative Strategies for Optimization (NICSO 2010)

Part of the book series: Studies in Computational Intelligence ((SCI,volume 284))

Abstract

The multiprocessor scheduling is one of the NP-complete scheduling problems. This problem comes when a known parallel program must be executed on a parallel computer. Different methods and algorithms have been tested for this scheduling problem. This paper presents and tests a hybrid bee algorithm. In this approach, the bee algorithm is combined with a heuristic in order to produce quickly good solutions. The choosen heuristic is a greedy approach and hybridization is done using the indirect representation. The heuristic is a list heuristic and the bee algorithm has to find the best order for the ordered list of tasks used by the heuristic. Experimental results on different benchmarks will be presented and analized, as well as a comparison with other hybrid approaches.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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. Chamaret, B., Rebreyend, P., Sandnes, F.E.: Scheduling problems: A comparison of hybrid genetic algorithms. In: Proceedings of the 2nd IASTED International Conference on Parallel and Distributed Computing and Networks, pp. 210–213. ACTA Press, Brisbane (1998) ISBN 0-88986-237-0, ISSN 1027-2658

    Google Scholar 

  2. Chong, C.S., Sivakumar, A.I., Low, M.Y.H., Gay, K.L.: A bee colony optimization algorithm to job shop scheduling. In: Perrone, L.F., Lawson, B., Liu, J., Wieland, F.P. (eds.) Winter Simulation Conference, WSC, pp. 1954–1961 (2006)

    Google Scholar 

  3. Corrêa, R., Ferreira, A., Rebreyend, P.: Integrating list heuristic into genetic algorithms for multiprocessor scheduling. In: Eighth IEEE Symposium on Parallel and Distributed Processing, pp. 462–469. IEEE Computer Society, New-Orleans (1996) ISSN-ISBN 0-8186-7683-3

    Google Scholar 

  4. Davidovic, T., Selmic, M., Teodorovic, D.: Scheduling independent tasks: Bee colony optimization approach. In: Mediterranean Conference on Control and Automation, pp. 1020–1025 (2009), http://doi.ieeecomputersociety.org/10.1109/MED.2009.5164680

  5. Hou, E.S., Ansari, N., Ren, H.: A genetic algorithm for multiprocessor scheduling. IEEE Transactions on Parallel and Distributed Systems 5(2), 113–120 (1994), http://doi.ieeecomputersociety.org/10.1109/71.265940

    Article  Google Scholar 

  6. Karaboga, D., Basturk, B.: On the performance of artificial bee colony (abc) algorithm. Applied Soft Computing 8(1), 687–697 (2008), http://www.sciencedirect.com/science/article/B6W86-4NWCGRR-G/2/422ccff5df9d32a5bf8517068ca2a094

    Article  Google Scholar 

  7. Kasahara, H., Narita, S.: Practical multiprocessor scheduling algorithms for efficient parallel processing. IEEE Transactions on computers C-33(11), 1023–1029 (1984)

    Article  Google Scholar 

  8. Kitajima, J.: Modèles quantitatifs d’algorithmes parallèles. PhD thesis, LMC-IMAG (1994)

    Google Scholar 

  9. Rebreyend, P.: Algorithmes génétiques hybrides en optimisation combinatoires. PhD thesis, Lip, ENS-Lyon, France (1999), http://pascal.rebreyend.free.fr/Fichiers/these.pdf

  10. Rebreyend, P., Sandnes, F., Megson, G.: Static multiprocessor task graph scheduling in the genetic paradigm: A comparison of genotype representations. Research Report RR1998-25, LIP-ENS-Lyon, 46 allée d’Italie, F-69364 Lyon Cedex 07, France (1998), ftp://ftp.ens-lyon.fr/pub/LIP/Rapports/RR/RR1998/RR1998-25.ps.Z

  11. Reeves, C.: Landscapes, operators and heuristic search. Annals of Operations Research 86(0), 473–490 (1986), http://dx.doi.org/10.1023/A:1018983524911

    MathSciNet  Google Scholar 

  12. Wong, L.P., Puan, C.Y., Low, M.Y.H., Chong, C.S.: Bee colony optimization algorithm with big valley landscape exploitation for job shop scheduling problems. In: Mason, S.J., Hill, R.R., Mönch, L., Rose, O., Jefferson, T., Fowler, J.W. (eds.) Winter Simulation Conference, WSC, pp. 2050–2058 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Rebreyend, P., Clugery, C., Hily, E. (2010). A Heuristic-Based Bee Colony Algorithm for the Multiprocessor Scheduling Problem. In: González, J.R., Pelta, D.A., Cruz, C., Terrazas, G., Krasnogor, N. (eds) Nature Inspired Cooperative Strategies for Optimization (NICSO 2010). Studies in Computational Intelligence, vol 284. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12538-6_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-12538-6_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-12537-9

  • Online ISBN: 978-3-642-12538-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics