The total time required to complete all the jobs in a job sequence problem is known as ______

Related MCQs

• The total time required to complete all the jobs in a job sequencing problem is known as .
• The order in which machines are required for completing the jobs is called
• The time during which a machine remains waiting or vacant in sequencing problem is called time.
• 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 ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
• When the total of allocations of a transportation problem match with supply and demand values, the solution is called solution.
• A given TP is said to be unbalanced, if the total supply is not equal to the total ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
• If the total supply is less than the total demand, a dummy source (row) is included in the cost matrix with ‐‐‐‐‐‐‐‐‐‐‐‐‐