SCHEDULING

Commonly Used Priorities Rules

1. First come, first served (FCFS)
2. Last come, first served (LCFS)
3. Earliest due date (EDD)
4. Shortest processing time (SPT)
5. Longest processing time (LPT)
6. Critical ratio (CR):
(Time until due date)/(processing time)
7. Slack per remaining Operations (S/RO)
Slack /(number of remaining operations)

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)
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 flow time
Average waiting time
Average and total lateness

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
accumulation of processing time each job by each job.
3. Earliest Due Date (EDD)
 Jobs are sequenced in increasing order of their due dates;
 The job with earliest due date is first, the one with the next earliest due date is second, and so
on;
 A priority sequencing rule that specifies that the job with the earliest due date is the next job to
be processed
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 earliest due date among the jobs.

1
 3. Thirdly, calculate the flow time of each job by using the processing time. The flow time is the
accumulation of processing time each job by each job.

4. Critical Ratio (CR)

 Is an index number computed by dividing the time remaining until due date by the work
time remaining.
 The critical ratio gives priority to jobs that must be done to keep shipping on schedule.
 The critical ratio is measure of urgency of any order compared to the other orders for
the same facility.
 The ratio is based on when the completed order is required and how much time is
required to complete.
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.
3. The formula for Critical Ratio is:
CR = time remaining / works day remaining
4. 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.

• The critical ratio help in most production scheduling system as below:

 Determine the status of specific job.
 Establish relative priority among jobs on a common basis.
 Relate both stock and make-to-order jobs on a common basis.
 Adjust priorities (and revise schedules) automatically for changes in both demand and job
progress.
 Dynamically track job progress and location.

Measuring Performance

 Job flow time:

o Time a job is completed minus the time the job was first available for processing; avg.
flow time measures responsiveness
 Average # jobs in system:
o Measures amount of work-in-progress; avg. # measures responsiveness and work-in-
process inventory
 Makespan:
2
 o The time it takes to finish a batch of jobs; measure of efficiency
 Job lateness:
o Whether the job is completed ahead of, on, or behind schedule;
 Job tardiness:
o How long after the due date a job was completed, measures due date performance

Processing Time (including setup times) and due dates for six jobs waiting to be processed at a
workcenter are given in the following table. Determine the sequence of jobs, the average flow
time, average tardiness, and number of jobs at the work center, for each of these rules:

• FCFS, SPT, EDD,

Job Processing Time Due Date

number

A 2 7
B 8 16
C 4 4
D 10 17
E 5 15
F 12 18

Solution:

First come, first served (FCFS)

Job Processing Flow Due Tardiness

Sequence Time Time Date
A 2 2 7 0
B 8 10 16 0
C 4 14 4 10
D 10 24 17 7
E 5 29 15 14
F 12 41 18 23
Totals 41 120 54

3
Average completion time
= Total completion Time/ No.of jobs
=120/6
= 20 days
Average number of jobs in the system
= Total completion Time/ Total Processing Time
=120/41
= 2.93 jobs
Average tardiness = Total tardiness / No.of jobs
= 54/6
= 9 days
Utilization
= (Total processing time/ Total completion time) x100
(41/120) x 100 = 34.17%

Shortest processing time (SPT)

Optimal sequence:

A C E B D F

Job Processing Flow Time Due Date Tardiness

Sequence Time
A 2 2 7 0
C 4 6 4 2
E 5 11 15 0
B 8 19 16 3
D 10 29 17 12
F 12 41 18 23
Totals 41 108 40

Average completion time

= Total completion Time/ No.of jobs
=108/6
= 18 days
Average number of jobs in the system
= Total completion Time/ Total Processing Time
=108/41
= 2.63 jobs

4
Average tardiness = Total tardiness / No.of jobs
= 40/6
= 6.67 days
Utilization
= (Total processing time/ Total completion time) x 100
= (41/108 ) x 100
= 37.96%

Earliest due date (EDD)

Optimal sequence:

C A E B D F

Job Processing Flow Due Tardiness

Sequence Time Time Date
C 4 4 4 0
A 2 6 7 0
E 5 11 15 0
B 8 19 16 3
D 10 29 17 12
F 12 41 18 23
Totals 41 110 38

Average completion time

= Total completion Time/ No.of jobs
= 110/6
= 18.33 days
Average number of jobs in the system
= Total completion Time/ Total Processing Time
= 110/41
= 2.68 jobs
Average tardiness = Total tardiness / No.of jobs
= 38/6
= 6.33 days
Utilization
= (Total processing time/ Total completion time) x 100 = (41/110) x 100
= 37.27%
5
 Processing Time (including setup times) and due dates for six jobs waiting to be
processed at a work center are given in the following table. Determine the sequence of
jobs, the average flow time, average tardiness, and number of jobs at the work center,
for each of these rules: FCFS, SPT, EDD, CR, STR

Job Processing Due Date Slack time Critical

time (days) (days hence) remaining Ratio
A 20 30 10 1.5
B 30 50 20 1.7
C 10 25 15 2.5
D 16 80 64 5.0
E 18 60 42 3.3

Solution:

First come, first served (FCFS)

FCFS Proc. Flow Due Lateness

Time Time Date
A 20 20 30 0
B 30 50 50 0
C 10 60 25 35
D 16 76 80 0
E 18 94 60 34
Total 94 300 245 69
Mean 60 13.8
Average completion time
= Total completion Time/ No.of jobs
=300/5
= 60 days
Average number of jobs in the system
= Total completion Time/ Total Processing Time
=108/41
= 2.63 jobs
Average tardiness or lateness
= Total tardiness / No.of jobs = 69/5
= 13.8 days
Utilization= (Total processing time/ Total completion time) x 100 = (94/300) x 100
6
 = 31.33%

Shortest processing time (SPT)

Optimal sequence:

C D E A B

SPT Proc. Flow Time to Lateness

Seq. Time Time Due

C 10 10 25 0
D 16 26 80 0
E 18 44 60 0
A 20 64 30 34
B 30 94 50 44
Total 94 238 245 78
Mean 47.6 15.6
Average completion time
= Total completion Time/ No.of jobs
=238/5
= 47.6days
Average number of jobs in the system
= Total completion Time/ Total Processing Time
=238/94
= 2.53 jobs
Average tardiness or lateness
= Total tardiness / No.of jobs = 78/5
= 15.6days
Utilization= (Total processing time/ Total completion time) x 100
= (94/238) x 100
= 39.49%

7
Earliest due date (EDD) :

Optimal sequence:

C A B E D

EDD Proc. Flow Time to Lateness

Seq. Time Time Due

C 10 10 25 0
A 20 30 30 0
B 30 60 50 10
E 18 78 60 18
D 16 94 80 14
Total 94 272 245 42
Mean 54.4 8.4

Average completion time

= Total completion Time/ No.of jobs
=272/5
= 54.4 days
Average number of jobs in the system
= Total completion Time/ Total Processing Time
=272/94
= 2.89 jobs
Average tardiness or lateness
= Total tardiness / No.of jobs = 42/5
= 8.4 days
Utilization= (Total processing time/ Total completion time) x 100 = (94/272) x 100
= 34.55 %

8
Critical Ratio

Optimal sequence:

A B C E D

CR Proc. Flow Time to Lateness

Seq. Time Time Due

A 20 20 30 0
B 30 50 50 0
C 10 60 25 35
E 18 78 60 18
D 16 94 80 14
Total 94 302 245 67
Mean 60.4 13.4

Average completion time

= Total completion Time/ No.of jobs
=302/5
= 60.4 days
Average number of jobs in the system
= Total completion Time/ Total Processing Time
=302/94
= 3.21 jobs
Average tardiness or lateness
= Total tardiness / No.of jobs = 67/5
= 13.4 days
Utilization= (Total processing time/ Total completion time) x 100 = (94/302) x 100
= 31.12 %

9
Slack Time Remaining (STR)
Optimal sequence:

A C B E D

job Proc. Flow Time to Lateness

Seq. Time Time Due

A 20 20 30 0
C 10 30 25 5
B 30 60 50 10
E 18 78 60 18
D 16 94 80 14
Total 94 282 245 47
Mean 56.4 9.4

Average completion time

= Total completion Time/ No.of jobs
=282/5
= 56.4 days
Average number of jobs in the system
= Total completion Time/ Total Processing Time
=282/94
= 3.0 jobs
Average tardiness or lateness
= Total tardiness / No.of jobs = 47/5
= 9.4 days
Utilization= (Total processing time/ Total completion time) x 100 = (94/282) x 100
= 33.33%

Comparing the priority rules

Rule Mean Flow Mean

Time Lateness
FCFS 60 13.8
SPT **47.6 15.6
STR 56.4 9.4
CR 60.4 13.4
EDD 54.4 **8.4

10
Flow shop scheduling

Sequencing Jobs through Two Work Centers –Johnson’s Rule

Johnson’s Rule – a technique for minimizing makespan in a two-stage, unidirectional process

Step 1 – List the jobs and the processing time for each activity

Step 2 – Find the shortest activity processing time among the jobs not yet scheduled

1. If the shortest Processing time is for a 1st activity, schedule that job in the earliest
available position in the job sequence
2. If the shortest processing time is for 2nd activity, schedule that job in the last available
position in the job sequence
3. When you schedule a job eliminate it from further consideration

Step 3 – Repeat step 2 until you have put all activities for the job in the schedule

EXAMPLE: Consider the following 2 machines and 6 jobs problem. Obtain optimum schedule
and corresponding makespan

PROCESSING TIME
JOB MACHINE 1 MACHINE 2
(M 1) (M 2)
1 5 4
2 2 3
3 13 14
4 10 1
5 8 9
6 12 11

Optimal sequence:

2 5 3 6 1 4

11