English

For the Following Problem, Find the Sequence that Minimize Total Elapsed Time (In Hours) Required to Complete the Following Jobs on Two Machines M1 and M2 in the Order M1 - M2: - Mathematics and Statistics

Advertisements
Advertisements

Question

For the following problem, find the sequence that minimize total elapsed time (in hours) required to complete the following jobs on two machines M1 and M2 in the order M1 - M2

Jobs A B C D E
Machine M1 5 1 9 3 10
Machine M2 2 6 7 8 4
Sum
Advertisements

Solution

The order is M1 - M2 hence required sequence is

B D C E A
shaalaa.com
Sequencing in Management Mathematics
  Is there an error in this question or solution?
2013-2014 (October)

APPEARS IN

Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×