H IGH LIGH T S

 SOLUT I ON T O A LL QUEST ION S

 SOLU T IONS ARE P UT IN WA Y T HE STU DEN T I S EX PE CTE D T O

RE PRODUCE IN TH E BOARD EX AM

 T AUG H T IN T HE CLA SS R OOM THE SAME WAY AS T HE

SOLUT I ON ARE PU T U P HERE . T HAT M AKE S T HE ST UDEN T T O
E A SI LY G O T HROUG H T HE SOLUT I ON & PRE PAR E HIM/HER SE LF
WH EN HE /SHE SI T S BA CK T O RE VI SE AN D RE CALL THE TOPI C n – JOBS ON 2 MACHINES ………. Pg 01
A T A NY G IVE N P OIN T OF TIME .

 LA ST LY , IF STU DEN T DUE T O SOME UNAV OI DABLE REASON S , n – JOBS ON 2 MACHINES ………. Pg 09
H A S M I SSE D T HE LECTU RE , WI LL N OT HAVE T O R UN HERE
A N D TH ERE T O UP DA TE H I S/ HER N OTES .

 H OWEVER ST UDE NT I S RE QUE STE D N OT TO MI SU SE T HE

A BOVE P OIN T A S CLA SS R OOM LE CTURE S ARE M U ST FOR E ASY
P A SSA GE OF UN DER STAN DI NG & LEARN ING T HE M INUE ST
DE TA I LS OF T HE GI VEN T OPI C
 SEQUENCING ‘N’ JOBS ON 2 MACHINES

Suppose we have two machines M 1 and M 2 . We have two jobs A and B to Let us try rev ersing the order of the jobs i.e we begin with job B instead
be processed on the two machines in the order M 1  M 2 of job A

Work table is as follows

Jobs

Machines A B MACHINES
M1 5 3 M1 M2

M2 3 5 JOBS IN OUT IN OUT

B 0 3 3 8

Suppose we start with job A and for simplicity we assume that we start at A 3 8 8 11

0 hrs , then we have the following

Hence the entire process is completed in 11 hrs .

MACHINES
Observe that , by merely changing the order in which the jobs were
M1 M2
performed on the machines , we could save 2 HRS
JOBS IN OUT IN OUT

A 0 5 5 8 Hence it is very important to know the order in which the jobs should be
B lined up for processing so as to complete the entire schedule in minimum

time

MACHINES Such problems are called “Sequencing Problems” where one has to
M1 M2 sequence the order in which n jobs are to be allotted to ‘m’ machines so
JOBS IN OUT IN OUT that total time required to complete all the jobs i s minimized
A 0 5 5 8
B 5 8 8 13

Hence the entire process is completed in 13 hrs .

1
TERMINOLOGY
HOW TO FIND OPTIMAL SEQUENCE
 Total Elapsed Time

Its is the time to complete all jobs . It is the time between the
Case 1: The smallest time occurs exactly at one place
beginning of the first job at the first machine till the completion of
 If this smallest time is for machine M 1 , then place the
the last job on the last machine
corresponding job at the first place in the sequence i.e
Since we begin with ‘0’ time , the total elapsed time is the last figure
towards the left of the sequence
in the worktable

 Idle time for machines  If this smallest time is for machine M 2 , then place the

‘Idle time’ means that the machine is available but is waiting for the corresponding job at the last available space in the sequence

job to be processed which is towards the right of the sequence

For machine M 1 ,

idle time = Total elapsed time  Last out time on Machine M 1 Case 2: the smallest time occurs at more than one place
 If all these timings are for machine M 1 then pick up any job
For Machine M 2 , idle time are of the following two categories
randomly and continue the placements from the first available
a) till the first job is processed by machine M 1 and is ready to
place from the left of the sequence
enter machine M 2 , the machine M 2 is idle

 Similarly if these timings are for machine M 2 , then once again

b) the machine M 2 has completed the ith job and it is waiting
you may pick up a job randomly and continue the placements
for (i+1) t h job to arrive . but (i+1) t h job is still in process in
from the last available place towards the right of the sequence .
machine M 1

 If these timings are for the machines M 1 as well as M 2 then job

MACHINES
showing minimum timing on M 1 will placed to the left of the
M1 M2
sequence and jobs showing minimum t iming of M 2 will be
JOBS IN OUT IN OUT
placed in the first available place to the right of the sequence
Idle time on M 2
A 0 3 3 7
Idle time on M 2 Once the sequence is decided , prepare the work table
B 3 8 8 14

C 8 13 14 18

2
 N JOBS ON 2 MACHINES

01. Find the sequence that minimizes total elapsed time (in hours) STEP 2

required to complete the following jobs o n two machines Mc A and

Job V I II III IV TOTAL PROCESSING
Mc B in the order AB . Also find the minimum elapsed time and idle
TIME (IN HOURS)
time for two machines
Mc A 2 3 3 7 5 = 20
Job I II III IV V
Mc B 5 6 4 2 1 = 18
Mc A 3 3 7 5 2

Mc B 6 4 2 1 5
WORK TABLE

Mc A Mc B
STEP 1
JOB IN OUT IN OUT IDLE

(2)
Min time = 1 on job IV on Mc B IV V 0 2 2 7
B C D
E F G I 2 5 7 13
NEXT
Min time = 2 on job V on Mc A V III IV II 5 8 13 17
on job III on Mc B B C D E
III 8 15 17 19 (1)
F G
IV 15 20 20 21
NEXT
Min time = 3 on job I,II on Mc A V I II III IV
B C D
RANDOM STEP 3
E F G
TOTAL ELAPSED TIME (T) = 21 HRS

IDLE TIME ON Mc A = T – 20 = 1 HRS

OPTIMAL SEQUENCE V I II III IV
IDLE TIME ON Mc B = T – 18 = 3 HRS
B C D E
F G (2 + 1 = 3 , CHECKED )

3
02. Five jobs must pass through a lathe and a surface grinder in that STEP 2

order . The processing time in hours are shown below . Determine

Job II IV V III I TOTAL PROCESSING
the optimal sequence of the jobs . Also find the idle time of eac h
TIME (IN HOURS)
machine
Mc 1 1 2 5 5 4 = 17
Job I II III IV V
Mc 2 2 3 6 4 3 = 18
LATHE (M 1 ) 4 1 5 2 5

GRINDER (M 2 ) 3 2 4 3 6
WORK TABLE

LATHE GRINDER
STEP 1
JOB IN OUT IN OUT IDLE

(1)
Min time = 1 on job II on M 1 II B C D II 0 1 1 3
E F G
IV 1 3 3 6 (2)
NEXT
Min time = 2 on job IV on M 1 II IV B C V 3 8 8 14
D E F G
III 8 13 14 18
NEXT
I 13 17 18 21
Min time = 3 on job I on M 2 II IV II B
C I D E F

NEXT G
STEP 3
Min time = 4 on job III on M 2 II IV III IB I
TOTAL ELAPSED TIME (T) = 21 HRS
C I D E F
G IDLE TIME ON LATHE = T – 17 = 4 HRS

OPTIMAL SEQUENCE II IV V III I IDLE TIME ON GRINDER = T – 18 = 3 HRS

B C D E
(1 + 2 = 3 , CHECKED )
F G

4
03. Find the sequence that minimizes total elapsed time (in hours) STEP 2

required to complete the following jobs on two machines X and Y

Job B D C E A TOTAL PROCESSING
in the order XY . Also find the minimum elapsed time and idle time
TIME (IN HOURS)
for two machines
Mc X 2 6 18 20 10 = 56

Mc Y 12 16 14 8 4 = 54
Job A B C D E

Mc X 10 2 18 6 20
WORK TABLE
Mc Y 4 12 14 16 8

M/C X M/C Y
STEP 1
JOB IN OUT IN OUT IDLE

(2)
Min time = 2 on job B on Mc X B B C D B 0 2 2 14
E F G
D 2 8 14 30
NEXT
Min time = 4 on job A on Mc Y B A C 8 26 30 44 (2)
B C D
E 26 46 46 54 (2)
NEXT E F G
A 46 56 56 60
Min time = 6 on job D on Mc X B D A I
B C I D E

NEXT F G
STEP 3
Min time = 8 on job E on Mc Y B D E AB I
TOTAL ELAPSED TIME (T) = 60 HRS
C I D E F
G
IDLE TIME ON M 1 = T – 56 = 4 HRS

OPTIMAL SEQ UENCE B D C E AB IDLE TIME ON M 2 = T – 54 = 6 HRS

C I D E
(2 + 2 + 2 = 6 , CHECKED )
B C D
E F G
5
04. A machine operator has to perform two operations , turning and STEP 2

threading on 6 different jobs . The time r equired to perform these

Job 4 1 3 2 5 6 TOTAL PROC
operations (in minutes ) is known . Determine the order in which
TIME (IN MINS)
the jobs should be processed in order to minimize the total time
TURNING 2 3 5 12 9 11 = 42
required to complete all the jobs Also find the total processing
THREADING 6 8 9 10 3 1 = 37
time and idle time for turning and threading operations
WORK TABLE
Job 1 2 3 4 5 6

TURNING 3 12 5 2 9 11
TURNING THREADING
THREADING 8 10 9 6 3 1
JOB IN OUT IN OUT IDLE
TURNING – M 1 , THREADING – M 2
(2)
STEP 1 4 0 2 2 8

1 2 5 8 16
Min time = 1 on job 6 on M2 6
B C D 3 5 10 16 25

NEXT E F G 2 10 22 25 35
Min time = 2 on job 4 on M 1 4 6
5 22 31 35 38 (4)
B C D
NEXT E F G 6 31 42 42 43

Min time = 3 on job 1 on M 1 4 1 5 6

on job 5 on M 2 B C D
STEP 3
NEXT E F G

Min time = 5 on job 3 on M 1 TOTAL ELAPSED TIME (T) = 43 MIN

4 1 3 5 6
on job 5 on M 2 B C D IDLE TIME ON TURNIG = T – 42 = 1 MIN
E F G
IDLE TIME ON THREADING = T – 37 = 6 MIN
OPTIMAL SEQUENCE
4 1 3 2 5 6 (2 + 4 = 6 , CHECKED )

B C D
E F G 6
05. Find the sequence that minimizes the total elapsed time to STEP 2
complete the following jobs in the order AB . Find the total TOTAL

elapsed time and idle time for both the machines Job VII I IV V II III VI PROCESSING TIME

Job I II III IV V VI VII M/c A 5 7 10 14 16 19 15 = 86

M/c A 7 16 19 10 14 15 5 M/c B 7 12 10 16 14 14 5 = 78

M/c B 12 14 14 10 16 5 7 WORK TABLE

STEP 1 MACHINE A MACHINE B

JOB IN OUT IN OUT IDLE

Min time = 5 on job VII on M A VII VI (5)
on job VI on M B VII 0 5 5 12

I 5 12 12 24
NEXT B C D E
F G IV 12 22 24 34 (2)
Min time = 7 on job I on M A VII I VI
V 22 36 36 52

II 36 52 52 66 (5)
NEXT B C D E
F G III 52 71 71 85 (1)
Min time = 10 on job I V on M A VII I IV VI
VI 71 86 86 91

STEP 3
NEXT B C D E
F G TOTAL ELAPSED TIME (T) = 91
Min time = 14 on job II & III VII I IV II III VI

on M B R AN DOM IDLE TIME ON MACHINE A = T – 86 = 5

IDLE TIME ON MACHINE B = T – 78 = 13

B C D E
OPTIMAL SEQUENCE
F G (5 + 2 + 5 + 1 = 13 , CHECKED )

VII I IV V II III VI

7
B C D E
06. Find the sequence that minimizes the total elapsed time to STEP 2
complete the following jobs in the order AB . Find the total TOTAL

elapsed time and idle time for both the machines Job III V II VI I IV VII PROCESSING TIME

Job I II III IV V VI VII M/c A 5 5 6 7 12 11 6 = 52 MIN

M/c A 12 6 5 11 5 7 6 M/c B 9 7 8 8 7 4 3 = 46 MIN

M/c B 7 8 9 4 7 8 3 WORK TABLE

(in minutes)

STEP 1 MACHINE A MACHINE B

JOB IN OUT IN OUT IDLE

Min time = 3 on job VII on M B VII (5)
VII 0 5 5 14

NEXT B
I 5 10 14 21
Min time = 4 on job IV on M B C D E F
IV VII
G IV 10 16 21 29

NEXT V 16 23 29 37

Min time = 5 on job III,V on III V IV VII II 23 35 37 44 (2)

B C D E
MA R AN DOM
F G III 35 46 46 50 (2)
NEXT B

Min time = 6 on job II on M A C D E F VI 46 52 52 55

III V II IV VII
G
STEP 3
NEXT
B C D E TOTAL ELAPSED TIME (T) = 55 MIN
Min time = 7 on job VI on M A III V II VI I IV VII
F G
IDLE TIME ON MACHINE A = T – 52 = 3 MIN
on job I on M B

IDLE TIME ON MACHINE B = T – 46 = 9 MIN

B C D E
OPTIMAL SEQUENCE
F G (5 + 2 + 2 = 9 , CHECKED )

III V II VI I IV VII

8
B C D E
 SEQUENCING ‘N’ JOBS ON 3 MACHINES

Reduce the problem to 2 machine and find the require d sequence in

the same way as we did in Ex 1 .

CONDITION TO BE SATISFIED

The minimum processing time on M 1 or M 3 has to at least the

maximum processing time on M 2

HOW TO CONVERT TO 2 – MACHINES

 Introduce two fictitious machines say G and H

 Processing time on G is the sum of the processing times on

machines M 1 and M 2

 Processing time on H is the sum of the processing times on

machines M 2 and M 3

 Symbolically we write it as G = M1 + M2

H = M2 + M3

WORK TABLE

Determine the optimal sequence for the two machines G and H as

we did in Ex 1 . Having done that forget the two fictitious machines

G , H and prepare the work table for M 1  M 2  M 3 using their time

schedule

9
 N JOBS ON 3 MACHINES

01. STEP 4

Find the optimal sequence that minimizes total t ime required to Job 2 5 4 3 1 TOTAL
PROC. TIME
complete the following jobs in the order ABC . The processing
M/c A 7 5 9 6 5 = 32 HRS
times are given in hrs
M/c B 1 3 5 4 2 = 15 HRS
Job 1 2 3 4 5 M/c C 7 7 6 5 3 = 28 HRS
M/c A 5 7 6 9 5

M/c B 2 1 4 5 3 WORK TABLE

M/c C 3 7 5 6 7
M/c A M/c B M/c C

STEP 1 : Min time on M/c A = 5 ; Max time on M/c B = 5 JOB IN OUT IN OUT IDLE IN OUT IDLE

Min time on M/c C = 3 (7) (8)

Min (M/c A)  Max (M/c B) ……… condition satisfied 2 0 7 7 8 (4) 8 15

5 7 12 12 15 (6) 15 22 (4)
STEP 2 : CONVERTING TO 2 FICTITIOUS M/C’S G & H
4 12 21 21 26 (1) 26 32
G = A + B
3 21 27 27 31 (1) 32 37
H = B + C
1 27 32 32 34 (6) 37 40
Job 1 2 3 4 5

G 7 8 10 14 8
STEP 5
H 5 8 9 11 10
TOTAL ELAPSED TIME (T) = 40 HRS

STEP 3 : Using the OPTIMAL SEQUENCE ALGORITHM IDLE TIME ON M/c A = T – 32 = 8 HRS

OPTIMAL SEQUENCE IDLE TIME ON M/c B = T – 15 = 25 HRS

2 5 4 3 1
(7+4+6+1+1+6 = 25 , CHECKED )
B
R AN DOM C D E IDLE TIME ON M/c C = T – 28 = 12 HRS
F G
(8 + 4 = 12 , CHECKED )

10
02. Find the optimal sequence that minimizes total time required STEP 4

to complete the following jobs in the order ABC . The Job 3 2 1 4 5 TOTAL
PROC. TIME
processing times are given in hrs
M/c A 6 10 8 7 11 = 42 HRS
Job 1 2 3 4 5
M/c B 2 6 5 3 4 = 20 HRS
M/c A 8 10 6 7 11 M/c C 8 9 4 6 5 = 32 HRS
M/c B 5 6 2 3 4

M/c C 4 9 8 6 5 WORK TABLE

STEP 1 : Min time on M/c A = 6 ; Max time on M/c B = 6

M/c A M/c B M/c C
Min time on M/c C = 4
JOB IN OUT IN OUT IDLE IN OUT IDLE
Min (M/c A)  Max (M/c B) ……… condition satisfied
(6) (8)
3 0 6 6 8 (8) 8 16
STEP 2 : CONVERTING TO 2 FICTITIOUS M/C’S G & H

G = A + B 2 6 16 16 22 (2) 16 25 (4)

H = B + C 1 16 24 24 29 (2) 29 33 (1)

Job 1 2 3 4 5 4 24 31 31 34 (8) 34 40 (6)

G 13 16 8 10 15
5 31 42 42 46 (5) 46 51
H 9 15 10 9 9

STEP 5
STEP 3 : Using the OPTIMAL SEQUENCE ALGORITHM

OPTIMAL SEQUENCE TOTAL ELAPSED TIME (T) = 51 HRS

3 2 1 4 5
IDLE TIME ON M/c A = T – 42 = 9 HRS
B C D
R AN DOM E
N OTE : J OBS 1 , 4 , 5 ARE PLACE D R AN DOMLY
F G IDLE TIME ON M/c B = T – 20 = 31 HRS
H EN CE T HERE AR E 6 OP T IMAL SE QUE NCE S . HOWEVER
(6+8+2+2+8+5 = 31 , CHECKED )
SOLUT I ON G IV EN AHE AD IS F OR T HE ABOVE OP TIM AL
IDLE TIME ON M/c C = T – 32 = 19 HRS
SE QUEN CE 3 – 2 – 1 – 4 – 5
(8 + 4 + 1 + 6 = 19 , CHECKED )

11
03. a publisher provides 5 books on Mathematics . The books STEP 4

have to go through composing , printing and binding done by Job A D E B C TOTAL

PROC. TIME
machines P,Q and R . The time schedule for entire task in
M/c P 4 6 5 9 8 = 32 HRS
hours is as follows
M/c Q 5 3 4 6 2 = 20 HRS
Job A B C D E M/c R 8 7 11 10 6 = 42 HRS
M/c P 4 9 8 6 5

M/c Q 5 6 2 3 4 WORK TABLE

M/c R 8 10 6 7 11
M/c P M/c Q M/c R
STEP 1 : Min time on M/c P = 4 ; Max time on M/c Q = 6
JOB IN OUT IN OUT IDLE IN OUT IDLE
Min time on M/c R = 6
(4) (9)
Min (M/c R)  Max (M/c Q) ……… condition satisfie d
A 0 4 4 9 (1) 9 17

STEP 2 : CONVERTING TO 2 FICTITIOUS M/C’S G & H D 4 10 10 13 (2) 17 24

G = P + Q , H = Q + R E 10 15 15 19 (5) 24 35

Job A B C D E B 15 24 24 30 (2) 35 45
G 9 15 10 9 9
C 24 32 32 34 (17) 45 51
H 13 16 8 10 15

STEP 5
STEP 3 : Using the OPTIMAL SEQUENCE ALGORITHM
TOTAL ELAPSE D TIME (T) = 51 HRS
OPTIMAL SEQUENCE
A D E B C IDLE TIME ON M/c P = T – 32 = 19 HRS
B DOM C
R AN D E
IDLE TIME ON M/c Q = T – 20 = 31 HRS
N OTE : J OBS A , D , E ARE P LACE D R AN DOMLY
F G
(4+1+2+5+2+17 = 31 , CHECKED )
H EN CE T HERE AR E 6 OP T IMAL SE QUE NCE S . HOWEVER
SOLUT I ON G IV EN AHE AD IS F OR T HE ABOVE OP TIM AL IDLE TIME ON M/c R = T – 42 = 9 HRS
SE QUEN CE A – D – E – B – C

12
04. A toy manufacturing company produces 5 typ es of toys . Each STEP 4

toy has to go through 3 machines A , B and C in the order Job 3 2 1 4 5 TOTAL

PROC. TIME
ABC . The time reuqired in hours for each process is given
M/c A 12 20 16 14 22 = 84 HRS
below
M/c B 4 12 10 6 8 = 40 HRS
Job 1 2 3 4 5 M/c C 16 18 8 12 10 = 64 HRS
M/c A 16 20 12 14 22

M/c B 10 12 4 6 8 WORK TABLE

M/c C 8 18 16 12 10
M/c A M/c B M/c C
STEP 1 : Min time on M/c A = 12 ; Max time on M/c B = 12
JOB IN OUT IN OUT IDLE IN OUT IDLE
Min time on M/c C = 8
(12) (16)
Min (M/c A)  Max (M/c B) ……… condition satisfied
3 0 12 12 16 (16) 16 32 (12)

STEP 2 : CONVERTING TO 2 FICTITIOUS M/C’S G & H 2 12 32 32 44 (4) 44 62

G = A + B , H = B + C 1 32 48 48 58 (4) 62 70
Job 1 2 3 4 5
4 48 62 62 68 (16) 70 82 (10)
G 26 32 16 20 30
5 62 84 84 92 (10) 92 102
H 18 30 20 18 18

STEP 5
STEP 3 : Using the OPTIMAL SEQUENCE ALGORITHM
TOTAL ELAPSED TIME (T) = 102 HRS
OPTIMAL SEQUENCE
3 2 1 4 5 IDLE TIME ON M/c A = T – 84 = 18 HRS

R AN DOM
B C D E
IDLE TIME ON M/c B = T – 40 = 62 HRS
N OTE : J OBS 1 , 4 , 5 ARE PLACE D R
F AN DOMLYG
(12+16+4+4+16+10 = 62 , CHECKED )
H EN CE T HERE AR E 6 OP T IMAL SE QUE N CE S . HOWEVER
IDLE TIME ON M/c C = T – 64 = 38 HRS
SOLUT I ON G IV EN AHE AD IS F OR T HE ABOVE OP TIM AL
SE QUEN CE 3 – 2 – 1 – 4 – 5 (16+12+10 = 12 , CHECKED )

13
05. STEP 4

Find the optimal sequence that minimizes total time required to Job III V II VI VII IV I TOTAL
PROC TIME
complete the following jobs in the order ABC . The processing
M/c A 5 6 7 7 12 11 6 = 54 HRS
times are given in hrs
M/c B 2 1 3 5 3 5 4 = 23 HRS
Job I II III IV V VI VII M/c C 7 9 8 8 7 4 3 = 46 HRS
M/c A 6 7 5 11 6 7 12

M/c B 4 3 2 5 1 5 3 M/c A M/c B M/c C

M/c C 3 8 7 4 9 8 7 JOB IN OUT IN OUT IDLE IN OUT IDLE

(5) (7)
STEP 1 : Min time on M/c A = 5 ; Max time on M/c B = 5 III 0 5 5 7 (4) 7 14
Min time on M/c C = 3
V 5 11 11 12 (6) 14 23
Min (M/c A)  Max (M/c B) ……… condition satisfied
II 11 18 18 21 (4) 23 31

STEP 2 : CONVERTING TO 2 FICTITIOUS M/C’S G & H VI 18 25 25 30 (7) 31 39 (1)

G = A + B
VII 25 37 37 40 (8) 40 47 (6)
H = B + C
IV 37 48 48 53 (1) 53 57 (1)
Job I II III IV V VI VII
I 48 54 54 58 (3) 58 61
G 10 10 7 16 7 12 15

H 7 11 9 9 10 13 10 STEP 5

TOTAL ELAPSED TIME (T) = 61 HRS

STEP 3 : Using the OPTIMAL SEQUENCE ALGORITHM
IDLE TIME ON M/c A = T – 54 = 7 HRS
OPTIMAL SEQUENCE
IDLE TIME ON M/c B = T – 23 = 38 HRS
(5+4+6+4+7+8+1+3 = 38 , CHECKED )
III V II VI VII IV I IDLE TIME ON M/c C = T – 46 = 15 HRS
C D E F (7+1+6+1 = 15 , CHECKED )
RANDOM
G

14
06. STEP 4

Find the optimal sequence that minimizes total time required to Job I IV VII VI II III V TOTAL
PROC TIME
complete the following jobs in the order ABC . The processing
M/c A 3 4 7 8 8 7 9 = 46 HRS
times are given in hrs
M/c B 4 5 3 4 3 2 1 = 22 HRS
Job I II III IV V VI VII M/c C 6 11 12 6 7 5 5 = 52 HRS
M/c A 3 8 7 4 9 8 7

M/c B 4 3 2 5 1 4 3 M/c A M/c B M/c C

M/c C 6 7 5 11 5 6 12 JOB IN OUT IN OUT IDLE IN OUT IDLE

(3) (7)
STEP 1 : Min time on M/c A = 3 ; Max time on M/c B = 5 III 0 3 3 7 7 13
Min time on M/c C = 5
V 3 7 7 12 (2) 13 24
Min (M/c C)  Max (M/c B) ……… condition satisfied
II 7 14 14 17 (5) 24 36

STEP 2 : CONVERTING TO 2 FICTITIOUS M/C’S G & H VI 14 22 22 26 (4) 36 42

G = A + B
VII 22 30 30 33 (4) 42 49
H = B + C
IV 30 37 37 39 (7) 49 54
Job I II III IV V VI VII
I 37 46 46 47 (12) 54 59
G 7 11 9 9 10 12 10

H 10 10 7 16 6 10 15
STEP 5

STEP 3 : Using the OPTIMAL SEQUENCE ALGORITHM TOTAL ELAPSED TIME (T) = 59 HRS

OPTIMAL SEQUENCE IDLE TIME ON M/c A = T – 46 = 13 HRS

IDLE TIME ON M/c B = T – 22 = 37 HRS

I IV VII VI II III V (3+2+5+4+4+7+12 = 37 , CHECKED )
C D E F IDLE TIME ON M/c C = T – 52 = 7 HRS
G

15