5.2 Processing N Jobs K Machines

Processing n jobs through k
machines
1
Introduction
• There is no general method available by which we can obtain
sequences in problems involving processing of n jobs on k
machines.
• They can be handled only by enumeration, which is a very lengthy

and time consuming exercise because a total of (n!)k different
sequences would require consideration in such a case.
• However, we do have a method applicable under the condition that

no passing of jobs is permissible and if either or both of the
conditions stipulated below is/are satisfied.
2
• Let there be n jobs, each of which is to be processed through k
machines, say M1,M2, --- , Mk in the order M1M2M3 --- Mk.
• Let Tij be the time taken by the ith machine to complete the jth job.
• List the jobs along with their processing times in a table.
Job Number : J1 J2 J 3 .......... J n

M1 : t11 t12 t13 .......... t1n
M : t t 22 t 23 .......... t 2n
 2 21
Processing Time on machine M 3 : t 31 t 32 t 33 .......... t 3n

.................

M k : t k1 t k2 t k3 .......... t kn
3
Optimum sequence Algorithm
• The iterative procedure of obtaining an optimal sequence is as
follows:
• Step I:Find (i) minj(T1j) ii) minj(Tmj) iii) maxj(T2j,T3j,T4j,---,T(k-1)j) for

j=1,2,---, n
• Step II: Check whether
• a. minj(T1j) ≥ maxj (Tij) for i=2,3,----,k-1
• Or
• b. minj(Tkj) ≥ maxj (Tij) for i=2,3,---,k-1
• Step III: If the inequalities in Step II are not satisfied, method fails,
otherwise, go to next step. 4
• Step IV: Convert the k machine problem into two machine problem by
introducing two fictitious machines G and H, such that
• TGj = T1j + T2j + --- +T(k-1)j and THj = T2j + T3j + --- +Tkj
• Determine the optimal sequence of n jobs through 2 machines by using

optimal sequence algorithm.
• Step V: In addition to condition given in Step IV, if Tij = T2j + T3j + ---
+Tkj = C is a fixed positive constant for all i = 1, 2, 3, … , n then
determine the optimal sequence of n jobs and two machines M1 and
Mk in the order M1Mk by using the optimal sequence algorithm.
• Step VI: In addition to condition given in Step IV, if T1j = Tkj and
TGj = THj for all j = 1, 2, 3, … , n then there will be n! optimal
sequences, each of which will yield minimum total elapsed time. 5
Problems
1. Find an optimal sequence for the following sequencing problem of
seven jobs and three machines when passing is not allowed, of which
processing time (in hours) is given below:
Job : J1 J2 J3 J4 J5 J6 J7
A : 3 8 7 4 9 8 7

Processing Time on machine B : 4 3 2 5 1 4 3
C :
 6 7 5 11 5 6 12
Also find the total elapsed time.
6
Solution
• The 7 jobs are to be processed in 3 machines A, B, C in the order
ABC
• n = 7, k = 3
• Here Min. T1j = 3, Min. T3j = 5, j= 1,2,…,7
• Max. T2j = 5
• Since Min. T3j = Max. T2j and therefore the problem can be
converted into 7 jobs and 2 fictitious machines G and H such that
tGj = T1j + T2j and tHj = T2j + T3j as follows:
7
Job A B C D E F G
Mac. G 7 11 9 9 10 12 10
Mac. H 10 10 7 16 6 10 15
A D G B F C E
The sequence is optimum one. The total elapsed time is

calculated below:
8
Jo Machine A Machine B Machine C Idle
b In Out In Out In Out time on
B
A 0 3 3 7 7 13 3
B 3 7 7 12 13 24 --
G 7 14 14 17 24 36 2
B 14 22 22 25 36 43 5
F 22 30 30 34 43 49 5
C 30 37 37 39 49 54 3
E 37 46 46 47 54 59 7
9
• T = 59 hrs
• Idle time of machine A is 59-46 = 13 hrs and
• Idle time of machine B is 3 + 2 + 5 + 5 + 3 + 7 + 12 = 37 hrs
• Idle time of machine C is 7 hrs
10
2. We have 4 jobs each of which has to go through machines Mj, j =
1,2, …., 6 in the order M1M2…M6. Processing time is given in hours.
JOB M1 M2 M3 M4 M5 M6
A 18 8 7 2 10 25
B 17 6 9 6 8 19
C 11 5 8 5 7 15
D 20 4 3 4 8 12
Find the optimum sequence of 4 jobs in order to minimize the total

elapsed time.
11
• Min. T1j = 11, Min. T6j = 12, Max. (T2j, T3j, T4j, T5j) = Max.
(8,9,6,10) = 10
• min (T1j) ≥ max (Tij), i = 2, 3, 4, 5
• min (T6j) ≥ max (Tij), i = 2, 3, 4, 5
• Now the problem can be converted into n jobs to 2 machines.
• where G = M1 + M2 + M3 + M4 + M5
• H = M2 + M 3 + M4 + M5 + M 6
JOBS A B C D
G 45 46 36 39
H 52 48 40 31 C A B D
12
Jobs M1 M2 M3 M4 M5 M6
In Out In Out In Out In Out In Out In Out
C 0 11 11 16 16 24 24 29 29 36 36 51
A 11 29 29 37 37 44 44 46 46 56 56 81
B 29 46 46 52 52 61 61 67 67 75 81 100
D 46 66 66 70 70 73 73 77 77 85 100 112
Total Elapsed time T = 112 hrs

Idle time of M1 is 112 - 66 = 46 hrs and
Idle time of M2 is 11 + (29 - 16) + (46 – 37) + (66 – 52) + (112 – 70) = 89 hrs
Idle time of M3 is 16 + (37 - 24) + (52 – 44) + (70 – 61) + (112 – 73) = 85 hrs
Idle time of M4 is 24 + 15 +15 + 6 +35 = 95 hrs
Idle time of M5 is 29 + 10 + 11 + 2 + 27 = 79 hrs
Idle time of M6 is 36 + 5 = 41 hrs
13
Practice Problems
1. Solve the following sequencing problem when passing out
Machine(Processing time in hrs.)

Item
A B C D
I 15 5 4 15
II 12 2 10 12
III 16 3 5 16
IV 17 3 4 17
14
2. Find the sequence that minimizes total elapsed time (in hours)
required to complete the following jobs on three machines A,
B, C in the following
Job: 1 2 3 4 5 6
A : 8 3 7 2 5 1
B : 3 4 5 2 1 6
C : 8 7 6 9 10 9
15

5.2 Processing N Jobs K Machines

Uploaded by

Copyright:

Available Formats

5.2 Processing N Jobs K Machines

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

5.2 Processing N Jobs K Machines

Uploaded by

Copyright:

Available Formats

Processing n jobs through k

• They can be handled only by enumeration, which is a very lengthy

• However, we do have a method applicable under the condition that

• List the jobs along with their processing times in a table.

Job Number : J1 J2 J 3 .......... J n

Processing Time on machine M 3 : t 31 t 32 t 33 .......... t 3n

• Step I:Find (i) minj(T1j) ii) minj(Tmj) iii) maxj(T2j,T3j,T4j,---,T(k-1)j) for

• Step II: Check whether

• a. minj(T1j) ≥ maxj (Tij) for i=2,3,----,k-1

• b. minj(Tkj) ≥ maxj (Tij) for i=2,3,---,k-1

• Determine the optimal sequence of n jobs through 2 machines by using

Also find the total elapsed time.

• Here Min. T1j = 3, Min. T3j = 5, j= 1,2,…,7

The sequence is optimum one. The total elapsed time is

• Idle time of machine A is 59-46 = 13 hrs and

• Idle time of machine B is 3 + 2 + 5 + 5 + 3 + 7 + 12 = 37 hrs

• Idle time of machine C is 7 hrs

Find the optimum sequence of 4 jobs in order to minimize the total

• min (T1j) ≥ max (Tij), i = 2, 3, 4, 5

• min (T6j) ≥ max (Tij), i = 2, 3, 4, 5

• Now the problem can be converted into n jobs to 2 machines.

Total Elapsed time T = 112 hrs

Machine(Processing time in hrs.)

You might also like