Skip to Main Content
Efficient scheduling of tasks for an application is critical for achieving high performance in Open Grid Services Architecture. The task scheduling has been shown to be NP complete in general case and also in several restricted cases. The paper introduces a novel framework for task scheduling problem based on Ant colony optimization (ACO). The performance of the algorithm is demonstrated by a Matlab program for producing effective schedules for random task sets.