Single-machine sequencing starts with ready jobs and exact processing times.

highlighted = computed this step

Job A

Job A has processing time 3.

pA=3p_A=3
Processing timesAll jobs are ready at the start and each has one processing time.processing timestimeA3B1C2

Job B

Job B has processing time 1.

pB=1p_B=1
Processing timesAll jobs are ready at the start and each has one processing time.processing timestimeA3B1C2

Job C

Job C has processing time 2.

pC=2p_C=2
Processing timesAll jobs are ready at the start and each has one processing time.processing timestimeA3B1C2

All ready

All jobs are ready at time zero, so the only decision here is the order.

all jobs ready at 0\text{all jobs ready at }0
Processing timesAll jobs are ready at the start and each has one processing time.processing timestimeA3B1C2