In order to solve stochastic scheduling problems in polynomial time, we studied a class of single machine stochastic scheduling problems 1|p_j~exp(λ_j)|E(w_jD_j) . It is proved that because of the specific property of exponential distribution, the problems have polynomial optimal algorithms in both nonpreemptive and preemptive situation. Its optimal algorithm is WSEPT rule.