Referenced Items are not available for this document.
Scheduling is one of the core steps to efficiently exploit the capabilities of heterogeneous distributed computing systems and it is also an appealing NP-complete problem. There is a number of heuristic and metaheuristic algorithms that were tailored to deal with scheduling of independent jobs. In this study we investigate the efficiency of three bio-inspired metaheuristics for finding good schedules of independent tasks.
Published in:
Intelligent Networking and Collaborative Systems (INCoS), 2012 4th International Conference on
Date of Conference: 19-21 Sept. 2012
- Page(s):
- 28 - 32
- Print ISBN:
- 978-1-4673-2279-9
- INSPEC Accession Number:
- 13115456
- Conference Location :
- Bucharest
- Digital Object Identifier :
- 10.1109/iNCoS.2012.76
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
