We present a new on-line algorithm, MR, for non-preemptive scheduling of jobs with known processing times on m identical machines which beats the best previous algorithm for m ⩾ 64. For m → ∞ its competitive ratio approaches 1 + √((1 + ln 2)/2) < 1.9201.
