Scribd
Upload
156 views

Sequencing Problems - Processing N Jobs Through 2 Machines Problem Calculator

The document presents a solution to the problem of processing 7 jobs through 2 machines in the optimal sequence. It lists the processing times for each job on each machine. It then determines the optimal job sequence using Johnson's algorithm, which sequences the jobs based on the smallest processing time first. The optimal sequence is found to be 6, 4, 1, 5, 3, 2, 7 with a total minimum elapsed time of 460 and idle times of 50 for Machine-1 and 95 for Machine-2.

Uploaded by

Basiya Kakawla
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
156 views

Sequencing Problems - Processing N Jobs Through 2 Machines Problem Calculator

The document presents a solution to the problem of processing 7 jobs through 2 machines in the optimal sequence. It lists the processing times for each job on each machine. It then determines the optimal job sequence using Johnson's algorithm, which sequences the jobs based on the smallest processing time first. The optimal sequence is found to be 6, 4, 1, 5, 3, 2, 7 with a total minimum elapsed time of 460 and idle times of 50 for Machine-1 and 95 for Machine-2.

Uploaded by

Basiya Kakawla
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Find solution of Processing 7 Jobs Through 2 Machines Problem

Job 1 2 3 4 5 6 7
Machine-1 20 90 80 20 120 15 65
Machine-2 25 60 75 30 90 35 50

Solution:
Job 1 2 3 4 5 6 7
Machine M 1 20 90 80 20 120 15 65

Machine M 2 25 60 75 30 90 35 50

1. The smallest processing time is 15 hour for job 6 on Machine-1. So job 6 will be processed first.
6

2. The next smallest processing time is 20 hour for job 4 on Machine-1. So job 4 will be processed after job 6.
6 4

3. The next smallest processing time is 20 hour for job 1 on Machine-1. So job 1 will be processed after job 4.
6 4 1

4. The next smallest processing time is 50 hour for job 7 on Machine-2. So job 7 will be processed last.
6 4 1 7

5. The next smallest processing time is 60 hour for job 2 on Machine-2. So job 2 will be processed before job 7.
6 4 1 2 7

6. The next smallest processing time is 75 hour for job 3 on Machine-2. So job 3 will be processed before job 2.
6 4 1 3 2 7

7. The next smallest processing time is 90 hour for job 5 on Machine-2. So job 5 will be processed before job 3.

6 4 1 5 3 2 7

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


6 4 1 5 3 2 7

M1 M1 M2 M2 Idle time
Job M2
In time Out time In time Out time
6 0 0 + 15 = 15 15 15 + 35 = 50 15
4 15 15 + 20 = 35 50 50 + 30 = 80 -
1 35 35 + 20 = 55 80 80 + 25 = 105 -
5 55 55 + 120 = 175 175 175 + 90 = 265 70
3 175 175 + 80 = 255 265 265 + 75 = 340 -
2 255 255 + 90 = 345 345 345 + 60 = 405 5
7 345 345 + 65 = 410 410 410 + 50 = 460 5

The total minimum elapsed time = 460

Idle time for Machine-1


= 460 - 410
= 50

Idle time for Machine-2


= 15 + 70 + 5 + 5 + (460 - 460)

= 95

You might also like