Assignment Problem and Sequencing (p-2) - Maharashtra Board STD 12 Commerce / Arts Maths (commerce) Questions

Q 1MCQ1 Mark

The assignment problem is said to be unbalanced if

A
Number of rows is greater than the number of columns
B
Number of rows is lesser than number of columns
C
Number of rows is equal to the number of columns
✓
Both (a) and (b)

Answer: D.

Q 2MCQ1 Mark

Using the Hungarian method the optimal assignment obtained for the following assignment problem to minimize the total cost is:

AGENT	JOB
AGENT	A	B	C	D
1	10	12	15	25
2	14	11	19	32
3	18	21	23	29
4	15	20	26	28

✓
$1- C , 2- B , 3- D , 4- A$
B
$1- B , 2- C , 3- A , 4- D$
C
$1- A , 2- B , 3- C _1 4- D$
D
$1- D , 2- A , 3- B , 4- C$

Answer: A.

View full solution →

Q 3MCQ1 Mark

To use the Hungarian method, a profit maximization assignments problem requires

✓
Converting all profit to opportunity losses
B
A dummy person or job
C
Matrix expansion
D
Finding the maximum number of lines to cover all the zeros in the reduced matrix

Answer: A.

View full solution →

Q 4MCQ1 Mark

In solving 2 machine and n jobs sequencing problem, the following assumption is wrong

A
No passing is allowed
B
Processing times are known
C
Handling times is negligible
✓
The time of passing depends on the order of machining

Answer: D.

View full solution →

Q 5MCQ1 Mark

The Assignment Problem is solved by

A
Simple method
✓
Hungarian method
C
Vector method
D
Graphical method

Answer: B.

View full solution →

Q 6Write true or false if statement is wrong write the true statement.1 Mark

The purpose of a dummy row or column in an assignment problem is to obtain a balance between a total number of activities and a total number of resources.

View full solution →

Q 7Write true or false if statement is wrong write the true statement.1 Mark

In an assignment problem, if a number of columns are greater than the number of rows, then a dummy column is added.

View full solution →

Q 8Write true or false if statement is wrong write the true statement.1 Mark

Using the Hungarian method, the optimal solution to an assignment problem is fund when the minimum number of lines required to cover the zero cells in the reduced matrix equals the number of people.

View full solution →

Q 9Write true or false if statement is wrong write the true statement.1 Mark

The optimal assignment is made in the Hungarian method to cells in the reduced matrix that contain a Zero.

View full solution →

Q 10Write true or false if statement is wrong write the true statement.1 Mark

In a sequencing problem, the processing times are dependent on the order of processing the jobs on machines.

View full solution →

Q 11Fil in The blanks.1 Mark

When the assignment problem has more than one solution, then it is ___________ optimal solution.

View full solution →

Q 12Fil in The blanks.1 Mark

The maximization assignment problem is transformed to minimization problem by subtracting each entry in the table from the ___________ value in the table.

View full solution →

Q 13Fil in The blanks.1 Mark

The time for which a machine j does not have a job to process to the start of job i is called ___________

View full solution →

Q 14Fil in The blanks.1 Mark

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 ___________

View full solution →

Q 15Fil in The blanks.1 Mark

A dummy row(s) or column(s) with the cost elements as ___________ the matrix of an unbalanced assignment problem as a square matrix.

View full solution →

Q 16Solve the Following Question.(3 Marks)3 Marks

A foreman wants to process 4 different jobs on three machines: a shaping machine, a drilling machine, and a tapping, the sequence of operations being shaping-drilling-tapping. Decide the optimal sequence for the four jobs to minimize the total elapsed time. Also, find the total elapsed time and the idle time for every machine.

Job	SHAPING (MINUTES)	DRILLING (MINUTES)	TRAPPING (MINUTES)
1	13	3	18
2	18	8	4
3	8	6	13
4	23	6	8

View full solution →

Q 17Solve the Following Question.(3 Marks)3 Marks

A toy manufacturing company has five types of toys. Each toy has to go through three machines A, B, C in the order ABC. The time required in hours for each process is given in the following table.

Type	1	2	3	4	5
Machine A	16	20	12	14	22
Machine B	10	12	4	6	8
Machine C	8	18	16	12	10

Solve the problem for minimizing the total elapsed time.

View full solution →

Q 18Solve the Following Question.(3 Marks)3 Marks

A plant manager has four subordinates, and four tasks to be performed. The subordinates differ in efficiency and the tasks differ in their intrinsic difficulty. This estimate of the times each man would take to perform each task is given in the effectiveness matrix below.

	I	II	III	IV
A	7	25	26	10
B	12	27	3	25
C	37	18	17	14
D	18	25	23	9

How should the tasks be allocated, one to a man, as to minimize the total man-hours?

View full solution →

Q 19Solve the Following Question.(3 Marks)3 Marks

An insurance company receives three types of policy application bundles daily from its head office for data entry and filing. The time (in minutes) required for each type for these two operations is given in the following table:

Policy	1	2	3
Data Entry	90	120	180
Filing	140	110	100

Find the sequence that minimizes the total time required to complete the entire task. Also, find the total elapsed time and idle times for each operation.

View full solution →

Q 20Solve the Following Question.(3 Marks)3 Marks

A company has three jobs on hand, Each of these must be processed through two departments, in the AB where
Department A: Press shop and
Department B: Finishing
The table below gives the number of days required by each job each department

Job	I	II	III
Department A	8	6	5
Department B	8	3	4

Find the sequence in which the three jobs should be processed so as to take minimum time to finish all the three jobs. Also find idle time for both the departments.

View full solution →

Q 21Solve the Following Question.(4 Marks)4 Marks

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

	Jobs (Processing times in minutes)
	I	II	III	IV	V	VI	VII
Machine A	12	6	5	11	5	7	6
Machine B	7	8	9	4	7	8	3

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

View full solution →

Q 22Solve the Following Question.(4 Marks)4 Marks

A chartered accountant’s firm has accepted five new cases. The estimated number of days required by each of their five employees for each case are given below, where-means that the particular employee can not be assigned the particular case. Determine the optimal assignment of cases of the employees so that the total number of days required to complete these five cases will be minimum. Also, find the minimum number of days.

Employee	Cases
	I	II	III	IV	V
E1	6	4	5	7	8
E2	7	-	8	6	9
E3	8	6	7	9	10
E4	5	7	-	4	6
E5	9	5	3	10	-

View full solution →

Q 23Solve the Following Question.(4 Marks)4 Marks

Consider the problem of assigning five operators to five machines. The assignment costs are given in the following table.

Operator	Machine
Operator	1	2	3	4	5
A	6	6	-	3	7
B	8	5	3	4	5
C	10	4	6	-	4
D	8	3	7	8	3
E	7	6	8	10	2

Operator A cannot be assigned to machine 3 and operator C cannot be assigned to machine 4. Find the optimal assignment schedule.

View full solution →

Q 24Solve the Following Question.(4 Marks)4 Marks

The estimated sales (tons) per month in four different cities by five different managers are given below:

Manager	Cities
Manager	P	Q	R	S
I	34	36	33	35
II	33	35	31	33
III	37	39	35	35
IV	36	36	34	34
V	35	36	35	33

Find out the assignment of managers to cities in order to maximize sales.

View full solution →

Q 25Solve the Following Question.(4 Marks)4 Marks

A dairy plant has five milk tankers, I, II, III, IV & V. These milk tankers are to be used on five delivery routes A, B, C, D & E. The distances (in kms) between the dairy plant and the delivery routes are given in the following distance matrix.

	I	II	III	IV	V
A	150	120	175	180	200
B	125	110	120	150	165
C	130	100	145	160	175
D	40	40	70	70	100
E	45	25	60	70	95

How should the milk tankers be assigned to the chilling centre so as to minimize the distance travelled?

View full solution →

Assignment Problem and Sequencing (p-2) question types

Assignment Problem and Sequencing (p-2) questions

Generate a Assignment Problem and Sequencing (p-2) paper free

Assignment Problem and Sequencing (p-2) Maths (commerce) - Assignment Problem and Sequencing (p-2)

Assignment Problem and Sequencing (p-2) question types

Assignment Problem and Sequencing (p-2) questions

Generate a Assignment Problem and Sequencing (p-2) paper free