A classical job-shop scheduling problem with n jobs (orders) and m machines is considered. Each job-operation 
(the 
operation of job 
) has a random time duration 
with the average value 
and the variance 
. Each job 
has its due date 
and its priority index 
. Given 
, the desired probability for job J i to be accomplished on time, and 
the least permissible probability for the job to meet its due date on time, the problem is to determine starting time values 
for each job-operation 
. Those values are not calculated beforehand and are values conditioned on our decisions. Decision-making, i.e., determining values 
is carried out at the moments when at least one of the machines is free for service and at least one job is ready to be processed on that machine. If at a certain moment t more than one job is ready to be processed, these jobs are compared pairwise. The winner of the first pair will be compared with the third job, etc., until only one job will be left. The latter has to be chosen for the machine. The competition is carried out by calculating the job's delivery performance, i.e., the probability for a certain job to meet its due date on time. Such a calculation is carried out by determining the probability to meet the deadline for a chain of random operations. Two different heuristics for choosing a job from the line will be imbedded in the problem. The first one is based on examining delivery performance values together with priority indices 
. The second one deals with examining confidence possibilities 
and 
and does not take into account priority indices. A numerical example is presented. Both heuristics are examined via extensive simulation in order to evaluate their comparative efficiency for practical industrial problems.
