1.

There are four jobs to be completed. Each job must go through machines M1, M2, M3 in the order M1 – M2 – M3. Processing time in hours is given below. Determine the optimal sequence and idle time for Machine M1.JobsABCDM15873M26725M378109

Answer»

The given problem is of n jobs and three machines. We change the problem in of n jobs and two machines.

For this either Min M1 ≤ M3 × M2 or min M3 ≤ max M2

Here min M3 = 7 = M1 × M2

Hence we write M1+ M2 = G and M2 + M3 = H the problem will be as follows

JobsABCD
G = M1+M2111598
H = M2+M313151214

The sequence as follows

Now

DCAB

jobM1M2M3
Time inTime outTime inTime outTime in Time out
D0338817
C31010121727
A101515212734
B152323303442

The minimum elapsed time = 42 hrs. Ideal time for M1 = 42 – 23 = 19 hrs.



Discussion

No Comment Found

Related InterviewSolutions