Unit 7:
Priority Sequencing Rules
7.1 Purpose of priority sequence rules
Priority Rules provide guidelines for the sequence in which jobs should be worked.
In using this rules, job processing times and due dates are important pieces of information.
Priority Rules try to minimize completion time, number of jobs in the system, and job lateness,
while maximizing facility utilization.
7.2 Types of Priority Sequencing Rules
1. First Come, First Served (FCFS).
Jobs are processed in the order in which they arrive at a machine or work center.
2. Shortest Processing Time (SPT).
Jobs are processed according to processing time at a machine or work center, shortest job first.
3. Earlier Due Date (EDD).
Jobs are processed according to due date, earlier due date first.
4. Critical Ratio (CR).
Jobs are processed according to smallest ratio of time remaining until due date to processing time
remaining.
7.3 First Come First Serve (FCFS)
The first job to arrive at a work centre is processed first by using FCFS.
The steps for using this rule are:
1. 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. Calculate the flow time of each job by using the processing time. the flow time is the
accumulations of processing time each job by each job.
3. Calculate the delays for each job of each job.
The delays is calculated from the flow time and due date. The formula is:
Delay ( Lateness ) = Flow time - Due date
a. If the delays calculated is less than flow time, then the delays = zero. ( - ve , zero )
b. If the delays calculated is more than flow time, then the delays = the value of (flow time - due
date). ( + ve , value )
4. The next step is calculating the total processing time, total flow time and total delays from the
accumulations processing time, the accumulations flow time and the accumulations delays.
45
5. Then, using the total flow time, total processing time, and total delays for calculating the
average completion time, the average number of jobs in the system , the average job delays
and the utilization, by using the following formulas (Performance measuring formula):
Average completion time = Total flow time / Number of jobs
Average no. of jobs in the system = Total flow time / Total processing time
Average job delays (Lateness ) = Total delay time / Number of jobs
Utilization = Total processing time / Total flow time
Example 1 9
Five jobs are to be done at custom furniture shop, their work (processing) times and due dates are
given in table below. According to FCFS rule determine
a. The sequence of processing .
b. The measures of effectiveness.
c. Do all the jobs get done on time ?
Date Promised
Job Days to Finish
( in Days from Today )
A 2 5
B 8 8
C 6 12
D 4 10
E 1 4
Solution :
a. The FCFS sequence is simply A-B-C-D-E. (Same table without change)
b. The "flow time" in the system for this sequence measures the time each jobs depends waiting
plus being processed.
Using a Gantt chart to determine Flow time
A B C D E
0 2 10 16 20 21
44
Delay (Lateness ) = Flow time - Due date
Job Sequence Work Time Flow Time Due Date Lateness (Delay)
A 2 2 5 0
B 8 10 8 2
C 6 16 12 4
D 4 20 10 10
E 1 21 4 17
Totals 21 69 33
The First Come First Serve rule results in the following measures of effectiveness:
Average completion time = 69/5 = 13.8 days
Average no. of jobs in the system = 69/21= 3.28 jobs
Average job delays (Lateness ) = 33/5 = 6.6 days
Utilization = 21/69 = 30.4 %
c. No, Jobs B, C, D and E are going to be late
Note :
Flow time : is the amount of time a job spent in shop or factory
Total work time or make span: is the time needed to process given set of jobs.
Lateness: different between completion time and due date (if (–ve) put it zero)
Same Terms
( Processing Time = Work Time = Workdays Remaining =Days to Finish = Production days
needed )
( Due Date = Date Promised )
( Delay = Lateness = Tardiness = Days Tardy )
( Flow Time = Completion Time )
45
7.4 Shortest Processing Time ( SPT )
The shortest job are handled first and completed.
The step for using this rule are:
1. 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. Sorting out the shortest processing time among the jobs.
3. Jobs are sequenced in increasing order of their processing time.
4. Repeat the same steps ( 2 , 3 , 4 , 5 ) used in FCFS rule.
Example 2 :
Suppose we have the four jobs to the left arrive for processing on one machine, their work
(processing) times and due dates are given in table below. According to SPT rule determine
a. The sequence of processing .
b. The measures of effectiveness.
c. Do all the jobs get done on time ?
Job ( in order of Processing Time Due Date
arrival) (days) (days hence )
A 4 5
B 7 10
C 3 6
D 1 4
Solution :
a. The SPT rule results in the sequence D-C-A-B.
Orders are sequenced according to processing time, with the highest priority given to shortest
job.
Job ( in order of Processing Time Due Date
arrival) (days) (days hence )
D 1 4
C 3 6
A 4 5
B 7 10
b. Using a Gantt chart to determine Flow time
D C A B
0 1 4 8 15
46
Delay (Lateness ) = Flow time - Due date
Job Sequence Work Time Flow Time Due Date Lateness (Delay)
D 1 1 4 0
C 3 4 6 0
A 4 8 5 3
B 7 15 10 5
Totals 15 28 8
The Shortest processing time (SPT) rule results in the following measures of effectiveness:
Average completion time = 28/4 = 7 days
Average no. of jobs in the system = 28/15= 1.867 jobs
Average job delays (Lateness ) = 8/4 = 2 days
Utilization = 15/28 = 53.57 %
c. Jobs A and B are going to be late.
7.5 Earliest Due Date (EDD)
The job with the earliest due date is selected first by using EDD.
The steps are using this rule are :
1. 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. Sorting out the earliest due date among the jobs.
3. Jobs are sequenced in increasing order of their due dates.
4. Repeat the same steps ( 2 , 3 , 4 , 5 ) used in FCFS rule.
Example 3 :
Five engine blocks are waiting for processing. The processing times have been estimated. Expected
completion times have been agreed. The table shows the processing time and due date of those 5
engines. According to EDD rule determine
a. The sequence of processing.
b. The measures of effectiveness.
c. Do all the jobs get done on time ?
Processing Time ( Due Date (
Engine Block
Days ) Days)
Ranger 8 10
Explorer 6 12
Bronco 15 20
Econoline 150 3 18
Thunderbird 12 22
47
Solution :
a. The EDD rule results in the sequence
Ranger - Explorer - Econoline 150 - Bronco - Thunderbird
Orders are sequenced according to due date , with the highest priority given to Earliest job.
Engine Block Processing Time Due Date
Sequence ( Days ) ( Days)
Ranger 8 10
Explorer 6 12
Econoline 150 3 18
Bronco 15 20
Thunderbird 12 22
b. Using a Gantt chart to determine Flow time ( Completion Time )
Ranger Explorer Econoline 150 Bronco Thunderbird
0 7 15 16 23 55
Delay (Lateness ) = Completion time - Due date
Engine Block Processing Completion
Due Date Days Tardy
Sequence Time Time
Ranger 8 8 10 0
Explorer 6 14 12 2
Econoline 150 3 17 18 0
Bronco 15 32 20 12
Thunderbird 12 44 22 22
Totals 44 85 36
Average completion time = 58/8 = 17 days
Average no. of jobs in the system = 85/44= 1.9318 jobs
Average job delays (Lateness ) = 63/8 = 7.2 days
Utilization = 44/85 = 51.76 %
c. Engine Blocks of Explorer , Bronco and Thunderbird are going to be late.
48
7.6 Critical Ratio(CR)
The Features of the critical ratio rule (CR) are9
1. Critical Ratio is an index number computed by dividing the time remaining until due date by the
work time remaining.
2. The critical ratio gives priority to jobs that must be done to keep shipping on schedule.
3. The critical ratio is measure of urgency of any order compared to the other orders for the same
facility.
4. The ratio is based on when the completed order is required and how much time is required to
complete.
The Benefits of the critical ratio rule (CR) are:
The critical ratio help in most production scheduling system as below:
1. Determine the status of specific job.
2. Establish relative priority among jobs on a common basis.
3. Relate both stock and make to order jobs on a common basis.
4. Adjust priorities (and revise schedules) automatically for changes in both demand and job
progress.
5. Dynamically track job progress and location.
The step for using this rule are:
1. At the starting program, user input the numbers of job, the jobs name, the works day remaining
and the due date of each job and as well the today's date.
2. The today's date and the number of job are just inputted once time. Then, the others are followed
the value of the number of jobs inputted. After that, compute the critical ratio by using the
formula:
CR = Time remaining / Workdays remaining
CR = ( Due date – Today's date ) / Processing time
3. After calculating the CR for each job, give the priority order by using the value of the calculated
critical ratio. The priority order is performed from smaller to larger.
4. There are 3 characteristics can be seen from the critical ratio:
If CR less than 1.0 ---- the job is falling behind schedule.
If CR is exactly 1.0 ---- the job is on schedule.
If CR is greater than 1.0 ---- the job is ahead of schedule and has some slack.
5. Repeat the same steps (2,3,4,5) used in FCFS rule.
56
Example 4 :
A machine center in a job shop for a local fabrication company has five unprocessed jobs remaining
at a particular point in time. The jobs are labeled 1, 2, 3, 4, and 5 in the order that they entered the
shop. The respective processing times and due dates are given in the table below. According to CR
rule determine
a. The sequence of processing.
b. The measures of effectiveness.
Job number Processing Time Due Date
1 11 61
2 29 45
3 31 31
4 1 33
5 2 32
Solution9
a. Find the processing sequence
CR = ( Due date – Today's date ) / Processing time
1. At Today's date = 0
Job number Processing Time Due Date CR
1 11 61 (61- 0) /11= 5.545
2 29 45 (45- 0) /29 = 1.552
3 31 31 (31- 0) /31= 1 (Lowest)
4 1 33 (33- 0) /1=33
5 2 32 (32- 0) /2= 16
Today's date should be reset after scheduling one job
2. At Today's date = ( 0 + 31) = 31 ( 1st sequence : job no. 3 )
Job number Processing Time Due Date CR
1 11 61 (61-31) / 11= 2.727
2 29 45 (45-31) / 29 = 0.483 ( Lowest)
4 1 33 (33-31) / 1= 2
5 2 32 (32-31) / 2 = 0.5
51
3. At Today's date = (31+ 29) = 60 ( 2nd sequence : job no. 2)
Job number Processing Time Due Date CR
1 11 61 (61- 60) / 11= 0.0909
4 1 33 (33- 60) / 1= - 27 ( Lowest)
5 2 32 (32- 60) / 2 = - 14
4. At Today's date = ( 60 + 1) = 61 ( 3rd sequence : job no. 4)
Job number Processing Time Due Date CR
1 11 61 (61- 61) / 11= 0
5 2 32 (32- 61) / 2 = - 14.5 ( Lowest)
So, ( 4th sequence : job no. 5 ) and (5th sequence : job no. 1)
The sequence of processing according to CR9 ( 3 – 2 – 4 – 5 – 1 )
b. Using a Gantt chart to determine Flow time ( Completion Time )
3 2 4 5 1
0 31 60 61 63 74
Delay (Lateness ) = Completion time - Due date
Job number Processing Completion
Due Date Lateness
Time Time
3 31 31 31 0
2 29 60 45 15
4 1 61 33 28
5 2 63 32 31
1 11 74 61 13
Totals 74 289 87
Average completion time = 289/8 = 57.8 days
Average no. of jobs in the system = 289/74= 3.905 jobs
Average job delays (Lateness ) = 87/8 = 17.4 days
Utilization = 74/289 = 25.61 %
53
