Stochastic scheduling problems with general position‐based learning effects and stochastic breakdowns

The focus of this study is to analyze position‐based learning effects in single‐machine stochastic scheduling problems. The optimal permutation policies for the stochastic scheduling problems with and without machine breakdowns are examined, where the performance measures are the expectation and variance of the makespan, the expected total completion time, the expected total weighted completion time, the expected weighted sum of the discounted completion times, the maximum lateness and the maximum tardiness.