Two problems of job scheduling on machines are considered. In both problems all jobs must be processed through the machines in the same order, and the order of jobs is the same on all machines. “Branch and Bound”-Algorithms (analogously to [I]) are formulated for the two following objectives a) RFP I : minimize make-span, b) RFP 11: minimize total idle time of all machines, to achieve an optimal solution. Waiting times are fixed to be zero for all jobs. Restrictions in the number of the machines .and the jobs are not necessary. The working of algorithms has been illustrated by numerical examples.