Scribd
Upload
772 views6 pages

Shortest Processing Time SPT

Shortest Processing Time (SPT) is a scheduling rule that sequences jobs in order of increasing processing time. It is optimal for minimizing average and total flowtime, average waiting time, and average and total lateness. An example is provided of 4 jobs - A, B, C, D - arriving for processing. Using SPT, jobs would be scheduled in order of D, C, A, B since they have the shortest processing times of 1, 3, 4, and 7 days respectively.

Uploaded by

ferina
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
772 views6 pages

Shortest Processing Time SPT

Shortest Processing Time (SPT) is a scheduling rule that sequences jobs in order of increasing processing time. It is optimal for minimizing average and total flowtime, average waiting time, and average and total lateness. An example is provided of 4 jobs - A, B, C, D - arriving for processing. Using SPT, jobs would be scheduled in order of D, C, A, B since they have the shortest processing times of 1, 3, 4, and 7 days respectively.

Uploaded by

ferina
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 6

Shortest Processing Time

(SPT)
• Shortest Processing Time. Jobs with the shortest
processing time are scheduled first

• Jobs are sequenced in increasing order of their


processing time

Shortest processing time is optimal for minimizing:

 Average and Total flowtime


 Average waiting time
 Average and Total lateness
19-2

Example of Job Sequencing: Shortest Processing Time

Jobs (in order Processing Due Date


Suppose we have the four
of arrival) Time (days) (days hence)
jobs to the right arrive for
A 4 5
processing on one machine
B 7 10
C 3 6
D 1 4

Answer: Shortest Operating Time Schedule

Jobs (in order Processing Due Date Flow Time Jobs A and B
of arrival) Time (days) (days hence) (days) are going to
D 1 4 1 be late
C 3 6 4
A 4 5 8
B 7 10 15
Example of SPT
.

Determine the schedule by using the SPT rule.

Job sequence Processing Time Due Date

A(turning) 6 8
B(drilling) 2 6
C(grinding) 8 18
D(milling) 3 15
E( facing) 9 23
4.3 Sequencing Rules
 The steps for using this rule are :
1. Firstly, the user will input the number of jobs, the job names,
the processing time and the due date of each job or use the
data values given at the starting point.
2. The second step is sorting out the shortest processing time among the jobs.

3 Thirdly, calculate the flow time of each job by using the


processing time. The flow time is the accummulation of of
processing time each job by each job.
Sequence SPT = B-D-A-C-E
•The formulas for calculation are below:

Mean Flow Time = sum of total flow / no. of jobs


=65/5
= 13 day
Average Tardiness = total day of tardy / no. of jobs
= 9/5
=1.8 day

No. of Tardiness = total day of tardy in no. of jobs


=3

You might also like