Consider scheduling n independent, single operation jobs, all available at time zero, on m identical processors. Further, assume that each job must be processed by exactly one of these processors, and it is desired to minimize makespan. This paper reports a computationally efficient procedure for treating this problem, which utilizes human ingenuity to improve on a traditional solution procedure. Computational experience with the procedure indicates that good solutions to large problems are easily obtained; in fact out of 240 test problems, the optimal solution was found in every case. The entire procedure is simple enough for a shop foreman to be able to solve large problems by hand.