Home
Class 12
MATHS
Solve the following problem of sequencin...

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

The optimal sequence of the jobs as follows:

Total elapsed time is obtained as follows:

Total elapsed time `T = square` minutes
Idle time for Machine `A = T- square = square` minutes
Idle time for Machine `B = square`

Text Solution

Verified by Experts

The correct Answer is:
Total Elapsed Time T = 32 hours
Idle Time for machine `M_1` = 11 hours
Idle Time for machine `M_2` = 1 hours
Promotional Banner

Topper's Solved these Questions

  • QUESTION BANK 2021

    NAVNEET PUBLICATION - MAHARASHTRA BOARD|Exercise Part II PROBABILITY DISTRIBUTIONS (I. Choose the correct alternative.)|9 Videos

  • QUESTION BANK 2021

    NAVNEET PUBLICATION - MAHARASHTRA BOARD|Exercise Part II PROBABILITY DISTRIBUTIONS (II. Fill in the blanks)|7 Videos

  • QUESTION BANK 2021

    NAVNEET PUBLICATION - MAHARASHTRA BOARD|Exercise Part II ASSIGNMENT PROBLEMS AND SEQUENCING (IV. Attempt the following questions)|10 Videos

  • PROBABILITY DISTRIBUTION

    NAVNEET PUBLICATION - MAHARASHTRA BOARD|Exercise MULTIPLE CHOICE QUESTIONS|9 Videos

  • THREE DIMENSIONAL GEOMETRY

    NAVNEET PUBLICATION - MAHARASHTRA BOARD|Exercise MULTIPLE CHOICE QUESTIONS|8 Videos

Similar Questions

Explore conceptually related problems

In sequencing problems one has to …. the total processing time or cost.

In sequencing problem the time required to transfer a job from one machine to another is…..

The idle time for a machine is the time when machine is available but is not waiting for any job to be processed. (True/False)