Scribd
Upload
3K views2 pages

Sequencing Problems Processing N Jobs Through M Machines Problem Example PDF

1. The document presents an example of solving a 5 job, 4 machine processing problem by finding the optimal job sequence using Johnson's algorithm. 2. The processing times for each job on each machine are provided in a table. By satisfying the conditions, the problem can be converted to a 2-machine problem. 3. Johnson's algorithm is then used to find the optimal job sequence as job 3, job 1, job 5, job 4, job 2, with a total minimum elapsed time of 84 time units. The idle times for each machine are also calculated.

Uploaded by

Saravana Selvakumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3K views2 pages

Sequencing Problems Processing N Jobs Through M Machines Problem Example PDF

1. The document presents an example of solving a 5 job, 4 machine processing problem by finding the optimal job sequence using Johnson's algorithm. 2. The processing times for each job on each machine are provided in a table. By satisfying the conditions, the problem can be converted to a 2-machine problem. 3. Johnson's algorithm is then used to find the optimal job sequence as job 3, job 1, job 5, job 4, job 2, with a total minimum elapsed time of 84 time units. The idle times for each machine are also calculated.

Uploaded by

Saravana Selvakumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Processing n Jobs Through m Machines Problem example

3. Find solution of Processing 5 Jobs Through 4 Machines Problem


Job 1 2 3 4 5
Machine-1 11 13 9 16 17
Machine-2 4 3 5 2 6
Machine-3 6 7 5 8 4
Machine-4 15 8 13 9 11

Solution:
Job 1 2 3 4 5
Machine M 1 11 13 9 16 17

Machine M 2 4 3 5 2 6
Machine M 3 6 7 5 8 4
Machine M 4 15 8 13 9 11

Since any of condition min {T1j } ≥ max {Tij } and/or min {Tmj } ≥ max {Tij }, for j=2,3,...,m-1 is satisfied.
So given problem can be converted to 2-machine problem.

Machine-1
21 23 19 26 27

Machine-2
2. The next smallest processing time is 19 hour for job 3 on Machine-1. So job 3 will be processed first.
3. The next smallest processing time is 19 hour for job 4 on Machine-2. So job 4 will be processed before job 2.
4. The next smallest processing time is 21 hour for job 1 on Machine-1. So job 1 will be processed after job 3.
5. The next smallest processing time is 21 hour for job 5 on Machine-2. So job 5 will be processed before job 4.

According to Johanson's algorithm, the optimal sequence is as below


3 1 5 4 2

M1 M1 M2 M2 M3 M3 M4 M4 Idle time Idle time Idle time


Job M2 M3 M4
In time Out time In time Out time In time Out time In time Out time
3 0 0+9=9 9 9 + 5 = 14 14 14 + 5 = 19 19 19 + 13 = 32 9 14 19
1 9 9 + 11 = 20 20 20 + 4 = 24 24 24 + 6 = 30 32 32 + 15 = 47 6 5 -
5 20 20 + 17 = 37 37 37 + 6 = 43 43 43 + 4 = 47 47 47 + 11 = 58 13 13 -
4 37 37 + 16 = 53 53 53 + 2 = 55 55 55 + 8 = 63 63 63 + 9 = 72 10 8 5
2 53 53 + 13 = 66 66 66 + 3 = 69 69 69 + 7 = 76 76 76 + 8 = 84 11 6 4

The total minimum elapsed time = 84

Idle time for Machine-1


= 84 - 66
= 18

Idle time for Machine-2


= 9 + 6 + 13 + 10 + 11 + (84 - 69)
= 64

Idle time for Machine-3


= 14 + 5 + 13 + 8 + 6 + (84 - 76)
= 54

Idle time for Machine-4


= 19 + 5 + 4 + (84 - 84)
= 28

You might also like