Scribd
Upload
7K views6 pages

Shortest Processing Time (SPT)

Shortest Processing Time (SPT) is a scheduling rule where jobs are sequenced in order of increasing processing time. This rule aims to minimize average and total flowtime, average waiting time, and average and total lateness. The document provides an example where 4 jobs (A, B, C, D) arrive for processing on one machine. When sequenced from shortest to longest processing time (D, C, A, B), jobs A and B will be late according to their due dates.

Uploaded by

mona7422
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
Download as ppt, pdf, or txt
7K views6 pages

Shortest Processing Time (SPT)

Shortest Processing Time (SPT) is a scheduling rule where jobs are sequenced in order of increasing processing time. This rule aims to minimize average and total flowtime, average waiting time, and average and total lateness. The document provides an example where 4 jobs (A, B, C, D) arrive for processing on one machine. When sequenced from shortest to longest processing time (D, C, A, B), jobs A and B will be late according to their due dates.

Uploaded by

mona7422
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
Download as ppt, pdf, or txt
Download as ppt, pdf, or txt
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


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

Answer: Shortest Operating Time Schedule

Jobs (in order of arrival) D C A B

Processing Due Date Flow Time Time (days) (days hence) (days) 1 4 1 3 6 4 4 5 8 7 10 15

Jobs A and B are going to be late

Example of SPT
. Determine the schedule by using the SPT rule.

Job sequence A(turning) B(drilling) C(grinding) D(milling) E( facing)

Processing Time 6 2 8 3 9

Due Date 8 6 18 15 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