I Introduction
THE resourceful use of multiprocessor systems highly depends on scheduling tasks to be performed on processors. The level of service in multiprocessor systems and the system's total costs primarily depend on a chosen schedule [7]. In this paper, we study the static problem of scheduling independent tasks on homogeneous multiprocessor systems. The word “static” means that we know in advance the total number of tasks, as well as the duration of each task. We assume that multiprocessor system contains m identical processors. The scheduling of n tasks to processors consists in assigning tasks to processors, as well as determining their starting times. Even this simple variant of the scheduling problem is known to be NP-hard [9]. These problems are usually solved by various heuristic algorithms or procedures based on meta-heuristic rules.