This article presents an efficient method to calculate in parallel the values of the Smarandache function S(i), i = 1, 2, …, n. The value S(i) can be sequentially found with a complexity of \frac{i}{{\log i}}. The computation has an important constraint, which is to have consecutive values computed by the same processor. This makes the dynamic scheduling methods inapplicable. The proposed solution is based on a Balanced Workload Block Scheduling method. Experiments show that the method is efficient and generates a good load balance.