The approach used in the present paper is to incorporate the heuristics into priority rules for the determination of the sequences of jobs on the machines. Both the static and dynamic problems are expounded theoretically. Simulation techniques necded for the understanding of dynamics inherent in the scheduling environment are introduced. Computational experiments in which various combined rules are ascertained and tested are also dealt with.