MATHS PAPER II-CHAPTER -7
TOPIC : ASSIGNMENT PROBLEMS
Q.1.ATTEMPT THE FOLLOWING MULTIPLE-CHOICE QUESTION
1. The objective of an assignment problem is to assign. (Feb 2025) (1M)
(a) Number of jobs to equal number of persons at maximum cost
(b) Number of jobs to equal number of persons at minimum cost
(c) Only to maximize the cost
(d) Only to minimize the cost
2. To use the Hungarian method, a profit maximization assignment problem requires (March 2024) (1M)
(a) Converting all profits 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.
Q.2.ATTEMPT THE FOLLOWING QUESTION (True or False)
1. In an assignment problem if the number of columns are greater than number of rows, then a dummy column is
added. (Jul 22, Mar 23, Jul 2024) (1M)
2. To convert maximization type assignment problem into a minimization problem, the smallest element in the
matrix is deducted from all elements of matrix. (March 2022) (1M)
Q.3.ATTEMPT THE FOLLOWING QUESTION.
1.Three new machines M₁, M₂, M₃ are to be installed in a machine shop. There are four vacant places A, B, C and
D are available. Due to limited space, machine M₂ cannot be placed at B. The cost matrix (in hundred rs ) is as
follows : Determine the optimum assignment schedule and find the minimum cost .(MARCH 2024) (3M)
Machine Places
A B C D
M1 13 10 12 11
M2 15 - 13 20
M3 5 7 10 6
2. Four new machines M₁, M₂, M₃ and M₄ are to be installed in a machine shop. There are five vacant places A, B,
C, D and E available. Because of limited space, machine M₂ cannot be placed at C and M₃ cannot be placed at A.
The cost matrix is given below. Find the optimal assignment schedule (JULY 2024, July 2022 ) (4)
Machine Places
A B C D E
M1 4 6 10 5 6
M2 7 4 - 5 4
M3 - 6 9 6 2
M4 9 3 7 2 3
TOPIC :SEQUENCING
Q.1.ATTEMPT THE FOLLOWING MULTIPLE-CHOICE QUESTION
1. If jobs I, II, III have processing times as 8, 6, 5 on machine M₁ and 8, 3, 4 on machine M₂ in the order M₁ - M₂;
then the optimal sequence is _____________. (July 24 ) (1M)
(a) I II III
(b) I III II
(c) II I III
(d) III II I
2. If job A to D have processing times 5, 6, 8, 4 on first machine and 4, 7, 9, 10 on second machine then the
optimal sequence is ____________ (July 2023)(1M)
(a) CDAB
(b) DBCA
(c) BCDA
(d) ADBC
3. In sequencing an optimal path minimizes ___________ (July 2022 ) (1M)
(a) Elapsed time
(b) Idle time
(c) Both (a) and (b)
(d) Ready time
Q.2.ATTEMPT THE FOLLOWING QUESTION
1. 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 total elapsed time:( JULY 2024)(3M)
Jobs I II III IV V
Lathe 4 1 5 2 5
Surface grinder 3 2 4 3 6
2. Find the sequence that minimizes the total elapsed time to complete the following jobs in the order AB. Find
the total elapsed time and idle time for machine B: (Feb 2025) (4M)
Jobs I II III IV V VI VII
Machine A 7 16 19 10 14 15 5
Machine B 12 14 14 10 16 5 7
3. A toy manufacturing company produces five types of toys. Each toy has to go through three machines A, B and
C in the order ABC. The time required in hours for each process is given in the following table. Find the total
elapsed time and also find idle time for machine B. (March 2024 ) (4M)
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
