Skip to Main Content
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.
Date of Conference: 19-21 Sept. 2012