HSC Commerce (English Medium) इयत्ता १२ वी - Maharashtra State Board Important Questions for Mathematics and Statistics

Find the optimal sequence that minimizes total time required to complete the following jobs in the order ABC. The processing times are given in hours.

If jobs A to D have processing times as 5, 6, 8, 4 on first machine and 4, 7, 9, 10 on second machine then the optimal sequence is ______.

If there are n jobs and m machines, then there will be_______ sequences of doing the jobs.

To use the Hungarian method, a profit maximization assignment problem requires ______.

Choose the correct alternative :

The assignment problem is said to be balanced if it is a ______.

The objective of an assignment problem is to assign ______. 

The time interval between starting the first job and completing the last job including the idle time (if any) in a particular order by the given set of machines is called _______.

The time required for printing of four books A, B, C and D is 5, 8, 10 and 7 hours, while its data entry requires 7, 4, 3 and 6 hrs respectively. The sequence that minimizes total elapsed time is ______.

Solve the following problem :

Five jobs must pass through a lathe and a surface grinder, in that order. The processing times in hours are shown below. Determine the optimal sequence of the jobs. Also find the idle time of each machine.

Solve the following problem :

Find the sequence that minimizes the total elapsed time to complete the following jobs. Each job is processed in order AB.

Determine the sequence for the jobs so as to minimize the processing time. Find the total elapsed time and the idle times for both the machines.

Choose the correct alternative:

If there are 3 machines A, B and C, conditions for reducing a 3 machine problem to a 2 machine problem with respect to minimum processing time is ______

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

An unbalanced assignment problems can be balanced by adding dummy rows or columns with ______ cost

In sequencing problem the time which required to complete all the jobs i.e. entire task is called ______

The optimum sequence for the above data is ______

State whether the following statement is True or False:

In sequencing problem the processing times are dependent of order of processing the jobs on machine

Find the assignments of salesman to various district which will yield maximum profit

Find the sequence that minimizes total elapsed time to complete the following jobs in the order XY. Find the total elasped time and idle times for each machine.

For the following assignment problem minimize total man hours:

Subtract the `square` element of each `square` from every element of that `square`

Subtract the smallest element in each column from `square` of that column.

The lines covering all zeros is `square` to the order of matrix `square`

The assignment is made as follows:

Optimum solution is shown as follows:

A → `square, square` → III, C → `square, square` → IV

Minimum hours required is `square` hours

State whether the following statement is true or false:

To convert a maximization-type assignment problem into a minimization problem, the smallest element in the matrix is deducted from all elements of the matrix.