English

Solve the following problem of sequencing for minimizing the total elapsed time and idle time for both the machines. - Mathematics and Statistics

Advertisements
Advertisements

Question

Solve the following problem of sequencing for minimizing the total elapsed time and idle time for both the machines.

Job P Q R S T U
M1 1 4 6 3 5 2
M2 3 6 8 8 1 5

The optimal sequence of the jobs as follows:

           

Total elasped time is obtained as follows:

Job
sequence
Machine A Machine B Idle time for
Machine B
Time
In
Time
Out
Time
In
Time
Out
P `square` 1 1 `square` `square`
U `square` 3 4 `square` `square`
S `square` 6 9 `square` `square`
Q `square` 10 17 `square` `square`
R `square` 16 23 `square` `square`
T `square` 21 31 `square` `square`

Total elapsed time T = `square` minutes

Idle time for Machine A = T – `square` = `square` minutes

Idle time for Machine B = `square`

Chart
Sum

Solution

Job P Q R S T U
M1 1 4 6 3 5 2
M2 3 6 8 8 1 5

The optimal sequence of the jobs as follows:

P U S Q R T

Total elapsed time is obtained as follows:

Job
sequence
Machine A Machine B Idle time for
Machine B
Time
In
Time
Out
Time
In
Time
Out
P 0 1 1 4 1
U 1 3 4 9 0
S 3 6 9 17 0
Q 6 10 17 23 0
R 10 16 23 31 0
T 16 21 31 32 0

Total elapsed time T = 32 minutes

Idle time for Machine A = T – 21 = 11 minutes

Idle time for Machine B = 1

shaalaa.com
Sequencing Problem
  Is there an error in this question or solution?
Chapter 2.7: Assignment Problem and Sequencing - Q.5

APPEARS IN

SCERT Maharashtra Mathematics and Statistics (Commerce) [English] 12 Standard HSC
Chapter 2.7 Assignment Problem and Sequencing
Q.5 | Q 2
Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×