English

For the Following Problem Find the Sequence that Minimizes Total Elapsed Time

Advertisements
Advertisements

Question

For the following problem find the sequence that minimizes total elapsed time (in hrs) required to complete the jobs on 2 machines M1 and M2 in the order M1 - M2 · Also find the minimum elapsed time T.

Job A B C D E F
M1 4 8 3 6 7 5
M2 6 3 7 2 8 4
Sum
Advertisements

Solution

From the given table, we can form the order 

C A E F B D

Thus the sequence As  C A E F B D. 

  Time in Time out Time in Time out
C 0 3 3 10
A 3 7 10 16
E 7 14 16 24
F 14 19 24 28
B 19 27 28 31
D 27 33 33 35

Total elapsed time T = 35 hrs.

shaalaa.com
Sequencing in Management Mathematics
  Is there an error in this question or solution?
2014-2015 (October)

APPEARS IN

Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×