J.K.SHAH CLASSES S.Y.J.C.

- STATISTICS

CHAPTER 7 ASSIGNMENT, PROBLEM & SEQUENCING

Introduction to Assignment Problem

1. An assignment problem can be represented, by nxn matrix which constitutes n
possible ways of making assignments
2. Assignment problem is a special case of Linear programming problem.
3. Assignment problem is a special type of problem which deals with allocation of
various resources to various activities on one to one basis.
It is done in such a way that the total cost or time involved in the process is
minimum or total profit is maximum
4. Hungarian method is an optimization algorithm that solves an Assignment
problem
Steps
 For minimization problem
1. Row Reduction
Reduce each row by subtracting minimum value from each row.
2. Column Reduction
Reduce each column by subtracting minimum value from each
Column.
3. Assign Zero
After applying first 2 steps you will get minimum 1 Zero (0) in each
Row & Column.
- Assign Single Zero ( 0 ) in each row & Cancel Zero from
respective column And vice-versa.
4. After applying step 3 you will get assign Zero ( 0 ) in each row &
column.
And if not, then apply rule of Ticked column & Unticked Row
5. Do Allocation & Find minimum values.
 Rule of Ticked Column & Unticked Row
1. Ticked (√1) the Row where there is No assign Zero ( 0 )
In that row
Check cancels Zero

Ticked (√2) the Column where there is Cancelled Zero

In that Column
Check the assign zero ( 0 )
Ticked (√3) the Row where there is assign Zero ( 0 )

: 338 :
J.K.SHAH CLASSES S.Y.J.C. - STATISTICS
2. Draw minimum line on Ticked column & Unticked Row

3. Reduce all the uncovered values by subtracting minimum value & Add the
Same at the intersection.
4. You will get revised matrix
Now do Re-assigning & Re-allocation process.

 Unbalanced matrix (Dummy Method)

Here, No of rows ≠ No. of. Columns

Take dummy Row or dummy column whichever is less and all values are Zero.
(0).
Now, follow steps of minimisation or maximisation depends upon question.

 Restricted Assignment Problem (Dash Method)

 Assign very high value “ ” to the prohibited cell

So that - Any No. =

 It means that particular cell/job cannot be assigned

 Do steps of minimization problem.

 Maximization Problem
- Find maximum value from overall
- Subtract all Elements in the matrix from the maximum value
- Now apply Rules of Minimization but at last find Maximum value.
Instead of Minimum value.

: 339 :
J.K.SHAH CLASSES S.Y.J.C. - STATISTICS

SEQUENCING

Introduction:
Such problem are called sequencing problems where one has to sequence the order
in which ‘n’ jobs are to be allotted to ‘m’ machines so that the total time required to
complete all the jobs is minimized.

 Terminology
1. Total elapsed Time: (T):
- Time taken to complete all jobs
- Time b/w the beginning of the first job at the first machine till the
completion of last job on the last machine.
- Since we begin with ‘0’ time total elapsed time is last figure in
worktable.
2. Idle time for machines:
Idle time is the time when the machine is available but waiting for a job to
be processed.
M
3. General Sequence ( )
n Jobs
M dift. Machines

Sequence out of General sequence which

Optimal Sequence
minimizes the total elapsed time.

 Types of sequencing problem

1. Sequencing ‘n’ jobs on 2 machines
2. Sequencing ‘n’ jobs on 3 machines

 Sequencing ‘n’ jobs on 3 machines

Reduce the problem to 2 machines & find the required sequence in the same
way as we did in 2 machine problem. Then worktable by taking 3 machine data,
to find total elapsed time & idle time of all 3 machine.

: 340 :
J.K.SHAH CLASSES S.Y.J.C. - STATISTICS
Condition
- Min. (M1) Max. (M2)
OR
- Min. (M3) Max. (M2)
Convert into 2 machines
- If Conditions are satisfied then convert 3 machines into 2 fictitious
machine say G & H
G = M 1 + M2
H = M 2 + M3
Now find optimal sequence and the Do worktable to find elapsed time &
idle time for 3 machines
Note 1: Conversion of 3 machines to 2 machines is only for finding
sequence
Note 2: Worktable prepared for 3 machines only.

: 341 :
J.K.SHAH CLASSES S.Y.J.C. - STATISTICS
OBJECTIVES
I) Choose the correct alternative.
1. In sequencing, an optimal path is one that minimizes__________
(a) Elapsed time (b) Idle time
(c) Both (a) and (b) (d) Ready time

2. If job 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 :
(a) CDAB (b) DBCA
(c) BCDA (d) ABCD

3. The objective of sequencing problem is

(a) to find the order in which jobs are to be made
(b) to find the time required for the completing all the job on hand
(c) to find the sequence in which jobs on hand are to be processed to
minimize the total time required for processing the jobs
(d) to maximize the cost

4. If there are n jobs and m machines, then there will be............ sequences of
doing the jobs.
(a) mn (b) m(n!) (c) nm (d) (n!)m

5. The Assignment Problem is solved by

(a) Simplex method,
(b) Hungarian method
(c) Vector method,
(d) Graphical method,

6. 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 time is negligible
(d) The time of passing depends on the order of machining

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

requires
(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

: 342 :
J.K.SHAH CLASSES S.Y.J.C. - STATISTICS
8. Using Hungarian method the optimal assignment obtained for the
following assignment problem to minimize the total cost is:
Agent Job
A B C D
1 10 12 15 25
2 14 11 19 32
3 18 21 23 29
4 15 20 26 28
(a) 1 — C, 2 — B , 3 — D, 4 — A (b) 1 — B, 2 — C, 3 — A, 4 — D
(c) 1 — A, 2 — B, 3 — C, 4 — D (d) 1 — D, 2 — A, 3 — B, 4 — C

9. The assignment problem is said to be unbalance if

(a) Number of rows is greater than number of columns
(b) Number of rows is lesser than number of columns
(c) Number of rows is equal to number of columns
(d) Both (a) and (b)

10. The assignment problem is said to be balanced if

(a) Number of rows is greater than number of columns
(b) Number of rows is lesser than number of columns
(c) Number of rows is equal to number of columns
(d) If the entry of row is zero

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

(a) Square matrix (b) Rectangular matrix
(c) Unit matrix (d) Triangular matrix

12. In an assignment problem if number of rows is greater than number of

columns then
(a) Dummy column is added (b) Dummy row is added
(c) Row with cost 1 is added (d) Column with cost 1 is added

13. In a 3 machine and 5 jobs problem, the least of processing times on

machine A, B and C are 5, 1. and 3 hours and the highest processing times
are 9, 5, and 7 respectively, then it can be converted to a 2 machine
problem if order of the machines is:
(a) B-A-C, (b) A-B-C (c) C-B-A (d) Any order

14. The objective of an assignment problem is to assign

(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 the maximize cost (d) Only to minimize cost

: 343 :
J.K.SHAH CLASSES S.Y.J.C. - STATISTICS
II) Fill in the blanks
1. An assignment problem is said to be unbalanced when ..............

2. When the number of rows is equal to the number of columns then the
problem is said to be assignment problem.

3. For solving an assignment problem the matrix should be a matrix.

4. If the given matrix is not a ................. matrix, the assignment problem is

called an unbalanced problem.

5. A dummy row(s) or column(s) with the cost elements as ................... the

matrix of an unbalanced assignment problem as a square matrix.

6. 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 ............

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

8. Maximization assignment problem is transformed to minimization problem

by subtracting each entry in the table from the._____value in the table.

9. When an assignment problem has more than one solution, then it

is................ optimal solution.

10. 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...........................

III) State whether each of the following is True or False.

1. One machine - one job is not an assumption in solving sequencing
problems.
2. If there are two least processing times for machine A and machine B,
priority is given for the processing time which has lowest time of the
adjacent machine.
3. To convert the assignment problem into a maximization problem, the
smallest element in the matrix is deducted from all other elements.
4. The Hungarian method operates on the principle of matrix reduction,
whereby the cost table is reduced to a set of opportunity costs.
: 344 :
J.K.SHAH CLASSES S.Y.J.C. - STATISTICS
5. In a sequencing problem, the processing times are dependent of order of
processing the jobs on machines.
6. Optimal assignments are made in the Hungarian method to cells in the
reduced matrix that contain a zero.
7. Using the Hungarian method, the optimal solution to an assignment
problem is found when the minimum number of lines required to cover
the zero cells in the reduced matrix equals the no of persons.
8. In an assignment problem, if number of column is greater than number of
rows, then a dummy column is added,
9. The purpose of dummy row or column in an assignment problem is to
obtain balance between total number of activities and total number of
resources.
10. One of the assumptions made while sequencing n jobs on 2 machines is :
two jobs must be loaded at a time on any machine.

Answers:
I)
1 2 3 4 5 6 7 8 9 10 11 12 13 14
c b c d b d a a d c a a b b

II) 1. Number of rows is not equal to the number of columns.

2. Balanced
3. Square
4. Square
5. Zero
6. Total elapsed time
7. Idle time
8. Maximum
9. Multiple
10. A-D-B-C

III) 1. False
2. True
3. False
4. True
5. False
6. True
7. True
8. False
9. True
10. False

: 345 :