Multiprocessors have been employed as a powerful computing means for executing real-time tasks, especially where a uniprocessor system would not be sufficient to execute all the tasks. This paper investigates dynamic scheduling algorithm for real-time tasks in a multiprocessor systems to obtain a feasible solution using genetic algorithms combined with earliest deadline first (EDF) and shortest computation time first (SCTF). A comparative study of the results obtained from simulations shows that genetic algorithm can be used to schedule tasks to meet their deadlines time , in addition to obtain high processor utilization.