Distributed systems offer considerable computational power, which can be used to solve problems with large computational requirements. The scheduling strategy that might be used in such a system is of great significance since the performance achieved is proportional to the algorithms effectiveness. An efficient scheduling strategy maximizes the system performance and avoids unnecessary delays. In this talk we will present various scheduling strategies in distributed systems for various workloads. Parallel jobs are examined. Simulation models are used to evaluate the performance of the scheduling algorithms.