The time during which a machine remains waiting or vacant in sequencing problem is called time.

Related MCQs

• The total time required to complete all the jobs in a job sequencing problem is known as .
• The operations Research technique which helps in minimizing total waiting and service costs is
• If the number of rows and columns in an assignment problem are not equal than it is called problem.
• When a maximization assignment problem is converted in minimization problem, the resulting matrix is called matrix.
• When a particular assignment in the given problem is not possible or restricted as a condition, it is called a problem.
• A minimization problem can be converted into a maximization problem by changing the sign of coefficients in the ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
• The total time required to complete all the jobs in a job sequence problem is known as ______
• To find initial feasible solution of a transportation problem the method which starts allocation from the lowest cost is called method
• When the total of allocations of a transportation problem match with supply and demand values, the solution is called solution.
• When the allocations of a transportation problem satisfy the rim condition (m + n – 1) the solution is called