b. Solve the following transportation problem using North-west corner method & Matrix minimum method.
Answer3(b).
Question4. The processing time of four jobs and five machines (in hours, when passing is not allowed) is given in following table
- Find an optimal sequence for the above sequencing problem.
- Calculate minimum elapsed time & idle time for machines A, B, C, D & E.
Answer4.
