Home
Class 12
MATHS
The Hungarian method is used to assign n...

The Hungarian method is used to assign n jobs on 2 machines to get the optimal sequence. (True/False)

Text Solution

Verified by Experts

The correct Answer is:
False
Promotional Banner

Topper's Solved these Questions

  • QUESTION BANK 2021

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

  • QUESTION BANK 2021

    NAVNEET PUBLICATION - MAHARASHTRA BOARD|Exercise Part II ASSIGNMENT PROBLEMS AND SEQUENCING (V. Activities) |2 Videos

  • QUESTION BANK 2021

    NAVNEET PUBLICATION - MAHARASHTRA BOARD|Exercise Part II ASSIGNMENT PROBLEMS AND SEQUENCING (II. Fill in the blanks)|12 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

Optimal assignments are made in the Hungarian method to cells in the reduced matrix that contain a zero. (True/False)

The Hungarian method is an .… algorithm that solves an assignment problem.

In assignment problem each worker or machine is assigned only one job. (True/False)

If there are n jobs and m machines, then there will be ......….sequence of doing jobs.

Matrices are used to store information, (True/False )

A convex lens is used to correct hypermetropia. True/False

A concave lens is used to correct myopia. True/False

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