In a recent paper, this journal, several stopping rules for Monte Carlo sampling for the general job scheduling problem were presented. This paper addresses the problem of using distribution free stopping rules, and the use of left-shifting to generate near-optimal job schedules. This paper will consider feasible job scheduling solutions obtained with left-shifting and without left-shifting In a single machine environment.