A hybrid ant algorithm for scheduling independent jobs in heterogeneous computing environments

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.

[thumbnail of 10.1.1.130.8001_1_.pdf]
Preview
 PDF. Filename: 10.1.1.130.8001_1_.pdf
Preprint
Download (78kB)| Preview

Abstract

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.

ORCID iDs

Ritchie, G. and Levine, J. ORCID logoORCID: https://orcid.org/0000-0001-7016-2978;
CORE (COnnecting REpositories)