Ritchie, G. and Levine, J. (2004) A hybrid ant algorithm for scheduling independent jobs in heterogeneous computing environments. In: Proceedings of the 23rd Workshop of the UK Planning and Scheduling Special Interest Group. UNSPECIFIED.
10.1.1.130.8001_1_.pdf - Draft Version
Download (78kB) | Preview
The efficient scheduling of independent computational jobs in a heterogeneous computing (HC) environment is an important problem in domains such as grid computing. Finding optimal schedules for such an environment is (in general) an NP-hard problem, and so heuristic approaches must be used. In this paper we describe an ant colony optimisation (ACO) algorithm that, when combined with local and tabu search, can find shorter schedules on benchmark problems than other techniques found in the literature.
|Item type:||Book Section|
|Keywords:||hybrid ant algorithm, heterogeneous computing environments, ant colony optimization, Electronic computers. Computer science|
|Subjects:||Science > Mathematics > Electronic computers. Computer science|
|Department:||Faculty of Science > Computer and Information Sciences|
|Depositing user:||Pure Administrator|
|Date Deposited:||22 Jul 2011 15:48|
|Last modified:||15 Apr 2015 10:52|
Actions (login required)