摘要：In scheduling, a set of machines in parallel is a setting that is important, from both the theoretical andpractical points of view. From the theoretical viewpoint, it is a generalisation of the single machinescheduling problem. From the practical point of view the occurrence of resources in parallel is common inreal-world.When machines are computers, a parallel program can be conceived as a set of parallel components (tasks)which can be executed according to some precedence relationship.In this case efficient scheduling of tasks permits to take full advantage of the computational power providedby a multiprocessor or a multicomputer system. This kind of planning involves the assignment of partiallyordered tasks onto the system architecture processing components.This paper shows the problem of allocating a number of non-identical tasks in a multiprocessor ormulticomputer system. The model assumes that the system consists of a number of identical processors andonly one task may execute on a processor at a time. All schedules and tasks are non-preemptive. The well-known Graham's list scheduling algorithm (LSA) is contrasted with an evolutionary approach using a directrepresentation of solutions
关键词：Parallel task allocation; Genetic Algorithm; List Scheduling Algorithm; Schemes of representation; Indirect;and Direct representation; Optimisation
