Scribd
Upload
3K views2 pages

Sequencing Problems Processing N Jobs Through 3 Machines Problem Example PDF

The document describes solving a 3 machine scheduling problem with 5 jobs. It provides the processing times for each job on each machine. It shows that the problem can be reduced to a 2 machine problem and provides the processing sequence and Gantt chart for the optimal solution. The optimal sequence is jobs 3, 2, 5, 4, 1 with a total elapsed time of 51 hours and idle times of 9, 31 and 19 hours for machines 1, 2 and 3 respectively.

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 3 Machines Problem Example PDF

The document describes solving a 3 machine scheduling problem with 5 jobs. It provides the processing times for each job on each machine. It shows that the problem can be reduced to a 2 machine problem and provides the processing sequence and Gantt chart for the optimal solution. The optimal sequence is jobs 3, 2, 5, 4, 1 with a total elapsed time of 51 hours and idle times of 9, 31 and 19 hours for machines 1, 2 and 3 respectively.

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 3 Machines Problem example

2. Find solution of Sequence Problem


Job 1 2 3 4 5
Machine-1 8 10 6 7 11
Machine-2 5 6 2 3 4
Machine-3 4 9 8 6 5

Solution:
Job 1 2 3 4 5
Machine M 1 8 10 6 7 11

Machine M 2 5 6 2 3 4

Machine M 3 4 9 8 6 5

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
13 16 8 10 15

Machine-2
9 15 10 9 9
4. The next smallest processing time is 9 hour for job 5 on Machine-2. So job 5 will be processed before job 4.
5. The next smallest processing time is 15 hour for job 2 on Machine-2. So job 2 will be processed before job 5.

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


3 2 5 4 1

M1 M1 M2 M2 M3 M3 Idle time Idle time


Job M2 M3
In time Out time In time Out time In time Out time
3 0 0+6=6 6 6+2=8 8 8 + 8 = 16 6 8
2 6 6 + 10 = 16 16 16 + 6 = 22 22 22 + 9 = 31 8 6
5 16 16 + 11 = 27 27 27 + 4 = 31 31 31 + 5 = 36 5 -
4 27 27 + 7 = 34 34 34 + 3 = 37 37 37 + 6 = 43 3 1
1 34 34 + 8 = 42 42 42 + 5 = 47 47 47 + 4 = 51 5 4

The total minimum elapsed time is 51

Idle time for Machine-1


= 51 - 42
=9

Idle time for Machine-2


= 6 + 8 + 5 + 3 + 5 + (51 - 47)
= 31

Idle time for Machine-3


= 8 + 6 + 1 + 4 + (51 - 51)
= 19

You might also like