Operation Scheduling

Job Sequencing
• Use priority rules for job sequencing of n/1 problem
Objective is to
 meet due date of customer
 minimize flow time (time a job spends in the process)
 minimize work-in-process inventory
 minimize idle time of the machine or worker
Priority Rules
• There are 10 priority rules
• Three of them are widely used for sequencing n/1 problem
These are:
1. FCFS – First come first served
2. SOT – Shortest operating time
3. DDATE – Earliest due date first
Mike Morales is the supervisor of Legal Copy-Express, which provides
copy services for down town Las Angles Law firms. Five customers
submitted their orders at the beginning of the week. Specific scheduling
data are as follows:
Jobs in order of arrival Processing time (days) Due date (days hence)
A 3 5
B 4 6
C 2 7
D 6 9
E 1 2

All orders requires the use of only one color copy machine. The
supervisor has to decide the sequence for the five orders. Find
optimum sequence of the work
FCFS
Job sequence Processing time Due date Flow time Lateness
(days) (days hence) (days) (days)
A 3 5 0+3=3 0
B 4 6 3+4=7 1
C 2 7 7+2=9 2
D 6 9 9 + 6 = 15 6
E 1 2 15 + 1 = 16 14

Mean Flow Time = (3 + 7 + 9 + 15 + 16) / 5 = 10 days

Mean Lateness = (0 + 1 + 2 + 6 + 14) / 5 = 4.6 days

SOT
Job sequence Processing time Due date Flow time Lateness
(days) (days hence) (days) (days)
E 1 2 0+1=1 0
C 2 7 1+2=3 0
A 3 5 3+3=6 1
B 4 6 6 + 4 = 10 4
D 6 9 10 + 6 = 16 7

Mean Flow Time = (1 + 3 + 6 + 10 + 16) / 5 = 7.2 days

Mean Lateness = (0 + 0 + 1 + 4 + 7) / 5 = 2.4 days

DDATE
Job sequence Processing time Due date Flow time Lateness
(days) (days hence) (days) (days)
E 1 2 0+1=1 0
A 3 5 1+3=4 0
B 4 6 4+4=8 2
C 2 7 8 + 2 = 10 3
D 6 9 10 + 6 = 16 7

Mean Flow Time = (1 + 4 + 8 + 10 + 16) / 5 = 7.8 days

Mean Lateness = (0 + 0 + 2 + 3 + 7) / 5 = 2.4 days

Comparison
FCFS SOT DDATE
Mean Flow Time
(days) 10 7.2 7.8
Mean Lateness 4.6 2.4 2.4
(days)
Job Sequence
A-B-C-D-E E-C-A-B-D E-A-B-C-D

Optimum sequence is E-C-A-B-D

n/2 (n jobs on 2 machines) problem
Johnson’s Rule:
Step-1 : List the operation time for each job on both machine
Step-2 : Select the shortest operating time
Step-3 : If the shortest time is for the first machine, do the job first; if it
is for the second machine, do the job last
Step-4 : Repeat step2 and 3 for each remaining job until the schedule is
complete
 Example of n/2 problem
Jobs Processing time on Processing time on M1 M2
M1 M2
A
A 3 2
B 6 8 D
C 5 6 C
D 7 4 B

C–B–D–A
5 11 18 21
M1
C B D A Ideal (4)
M2 Ideal (5) C B D A
11 19 23 25
All job completion time = 25 days

Ideal time for M1 = 4 days

Ideal time for M2 = 5 days

Another example of n/2 problem
Jobs Processing time for M1 Processing time for M2
A 5 2
B 16 15
C 1 9
D 13 11
E 17 3
F 18 7
n/n problem – (n jobs on n number of machine)
Machine/contractor/shop
Machine/contractor/shop
M1 M2 M3 M4
M1 M2 M3 M4
J1 15 13 14 17 J1 2 0 1 4
J2 11 12 15 13 J2 0 1 4 2
Jobs

Jobs
J3 13 12 10 11 J3 3 2 0 1
J4 15 17 14 16 J4 1 3 0 2

Step-1 : Select the minimum operating time/cost

for each of the row and deduct the selected
minimum value from each of the elements of
each row
 Machine/contractor/shop Machine/contractor/shop

M1 M2 M3 M4 M1 M2 M3 M4
J1 2 0 1 4 J1 2 0 1 3
J2 0 1 4 2 J2 0 1 4 1
Jobs

Jobs
J3 3 2 0 1 J3 3 2 0 0
J4 1 3 0 2 J4 1 3 0 1

Step-2 : Select the minimum operating time/cost

for each of the column and deduct the selected
minimum value from each of the elements of
each column
 Machine/contractor/shop

Step-3 : Draw minimum number of M1 M2 M3 M4

horizontal or vertical lines to cross all the J1 2 0 1 3

zeroes in the matrix J2 0 1 4 1

Jobs
J3 3 2 0 0
J4 1 3 0 1

Stopping rule: If the minimum number of

horizontal or vertical line crossing all zeroes
in the matrix is equal to the number of jobs
or variables the we have to stop and assign
the jobs. But if it is less we have to go for
next step
 Machine/contractor/shop

M1 M2 M3 M4

Assign the jobs J1 2 0

c
1 3
J2 0 1 4 1

Jobs
J3 3 2 0 0
c
J4 1 3 0 1
J1 - M2 - 13 c

J2 - M1 - 11
J4 - M3 - 14
J3 - M4 - 11
Total = 49
 Machine/contractor/shop Machine/contractor/shop

M1 M2 M3 M4 M5 M1 M2 M3 M4 M5
J1 11 17 8 16 20 J1 3 9 0 8 12
J2 9 7 12 6 15 J2 3 1 6 0 9
Jobs

Jobs
J3 13 16 15 12 16 J3 1 4 3 0 4
J4 21 24 17 28 26 J4 4 7 0 11 9
J5 14 10 12 11 13 J5 4 0 2 1 3

Step-1 : Select the minimum operating time/cost

for each of the row and deduct the selected
minimum value from each of the elements of
each row
 Machine/contractor/shop Machine/contractor/shop

M1 M2 M3 M4 M5 M1 M2 M3 M4 M5

J1 3 9 0 8 12 J1 2 9 0 8 9
J2 3 1 6 0 9 J2 2 1 6 0 6

Jobs
J3 0 4 3 0 1
Jobs

J3 1 4 3 0 4
J4 4 7 0 11 9 J4 3 7 0 11 6
J5 4 0 2 1 3 J5 3 0 2 1 0

Step-2 : Select the minimum operating time/cost

for each of the column and deduct the selected
minimum value from each of the elements of
each column
 Machine/contractor/shop Machine/contractor/shop

M1 M2 M3 M4 M5 M1 M2 M3 M4 M5
J1 2 9 0 8 9 J1 2 9 0 8 9
J2 2 1 6 0 6 J2 2 1 6 0 6
Jobs

J3 0 4 3 0 1

Jobs
J3 0 4 3 0 1
J4 3 7 0 11 6 J4 3 7 0 11 6
J5 3 0 2 1 0 J5 3 0 2 1 0

Stopping rule: If the minimum number of horizontal or

Step-3 : Draw minimum number of horizontal or
vertical lines to cross all the zeroes in the matrix
vertical line crossing all zeroes in the matrix is equal to
the number of jobs or variables the we have to stop
and assign the jobs. But if it is less we have to go for
next step
 Machine/contractor/shop Machine/contractor/shop

M1 M2 M3 M4 M5 M1 M2 M3 M4 M5
J1 2 9 0 8 9 J1 2 8 0 8 8
J2 2 1 6 0 6 J2 2 0 6 0 5
Jobs

J3 0 4 3 0 1

Jobs
J3 0 3 3 0 0
J4 3 7 0 11 6 J4 3 6 0 11 5
J5 3 0 2 1 0 J5 4 0 3 2 0

Step 4: Find the minimum value from all the free elements
(elements those not crossed by the lines) of the matrix and
deduct this minimum value from all the free elements; other
elements which are crossed by the lines will be unchanged
except the intersections of the lines and we have add this
minimum value to this intersection elements
 Machine/contractor/shop Machine/contractor/shop

M1 M2 M3 M4 M5 M1 M2 M3 M4 M5
J1 2 8 0 8 8 J1 2 8 0 8 8
J2 2 0 6 0 5 J2 2 0 6 0 5
Jobs

J3 0 3 3 0 0

Jobs
J3 0 3 3 0 0
J4 3 6 0 11 5 J4 3 6 0 11 5
J5 4 0 3 2 0 J5 4 0 3 2 0

Stopping rule: If the minimum number of

Step-3 : Draw minimum number of horizontal or horizontal or vertical line crossing all zeroes in the
vertical lines to cross all the zeroes in the matrix matrix is equal to the number of jobs or variables
the we have to stop and assign the jobs. But if it is
less we have to go for next step
 Machine/contractor/shop Machine/contractor/shop

M1 M2 M3 M4 M5 M1 M2 M3 M4 M5
J1 2 8 0 8 8 J1 0 6 0 6 6
J2 2 0 6 0 5 J2 2 0 8 0 5
Jobs

J3 0 3 3 0 0

Jobs
J3 0 3 5 0 0
J4 3 6 0 11 5 J4 1 4 0 9 3
J5 4 0 3 2 0 J5 4 0 5 2 0

Step 4: Find the minimum value from all the free elements
(elements those not crossed by the lines) of the matrix and deduct
this minimum value from all the free elements; other elements
which are crossed by the lines will be unchanged except the
intersections of the lines and we have add this minimum value to
this intersection elements
 Machine/contractor/shop Machine/contractor/shop

M1 M2 M3 M4 M5 M1 M2 M3 M4 M5
J1 0 6 0 6 6 J1 0 6 0 6 6
J2 2 0 8 0 5 J2 2 0 8 0 5
Jobs

Jobs
J3 0 3 5 0 0 J3 0 3 5 0 0
J4 1 4 0 9 3 J4 1 4 0 9 3
J5 4 0 5 2 0 J5 4 0 5 2 0

Stopping rule: If the minimum number of

Step-3 : Draw minimum number of horizontal or horizontal or vertical line crossing all zeroes in the
vertical lines to cross all the zeroes in the matrix matrix is equal to the number of jobs or variables
the we have to stop and assign the jobs. But if it is
less we have to go for next step
Assign the jobs
 Machine/contractor/shop Machine/contractor/shop
Sol -1 n
M1 M2 M3 M4 M5
Sol -2 n
M1 M2 M3 M4 M5
J1 0 6 0 6 6 J1 0 6 0 6 6
c c
J2 2 0 8 0 5 J2 2 0 8 0 5
3c c
Jobs

Jobs
J3 0 5 0 0 J3 0 3 5 0 0
J4 1 4 0 9c 3 J4 1 4 0 9 3c
J5 4 0 5c 2 0 J5 4 0 5c 2 0
c c

J4 - M3 - 17 J4 - M3 - 17
J1 - M1 - 11 J1 - M1 - 11
J2 - M2 - 7 J2 - M4 - 6
J5 – M5 - 13 J3 – M5 - 16
J3 - M4 - 12 J5 - M2 - 10
Total = 60 Total = 60
Thank You