On upper bound of schedules for solution of independent problems in batch operation of uniform computing systems

The upper bounds are found of time in which a package of independent simple problems (each requiring one processor) is solved in a specified number of processors and the number of processors needed for execution of a package of independent complex problems (each requiring more than one processor) within a fixed number of cycles. The proposed bounds are shown to be below those reported earlier.