Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
0% found this document useful (0 votes)
376 views

Assignment Problem

1. The document provides 13 examples of assignment problems with matrices containing costs, times, or profits associated with assigning jobs, tasks, machines, or items to other jobs, tasks, machines, or locations. 2. The goal is to determine the optimal assignments that minimize costs, times, or maximize profits based on the data provided in the matrices. 3. Solutions involve analyzing the matrices to determine the assignments that meet the objective of minimizing or maximizing the given criteria.

Uploaded by

Mohammed Sobhi
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
376 views

Assignment Problem

1. The document provides 13 examples of assignment problems with matrices containing costs, times, or profits associated with assigning jobs, tasks, machines, or items to other jobs, tasks, machines, or locations. 2. The goal is to determine the optimal assignments that minimize costs, times, or maximize profits based on the data provided in the matrices. 3. Solutions involve analyzing the matrices to determine the assignments that meet the objective of minimizing or maximizing the given criteria.

Uploaded by

Mohammed Sobhi
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

PANCHAKSHARI’S PROFESSIONAL ACADEMY PVT LTD

12th Maths : Examples on Assignment Problem:


1) A job production unit has four jobs A, B, C, D How should the tasks be assigned to machines
which can be manufactured on each of the to minimize requirement of machine hours?
four machines P, Q, R & S. the processing cost
4) Three different aeroplanes are to be assigned
of each job for each machine is given below:
to handle three cargo consignments with a
Machines view to maximize profit. The profit matrix (in
Jobs P Q R S lakhs) of Rs. is as follows:
Processing cost (Rs.) Cargo Consignment
Aeroplanes
A 31 25 33 29 C1 C2 C3
B 25 24 23 21 C1 1 4 5
C 19 21 23 24 C2 2 3 3
D 38 36 34 40 C3 3 1 2
How the job should be assigned to machines How should the cargo consignments be
so that the total processing cost is minimum. assigned to aeroplanes to minimize the profit?

2) A computer centre has four expert 5) A Pharmaceutical company has four branches,
programmers. The centre needs four one at each city A, B, C, and D. A branch
application programmers to be developed. manger is to be appointed one at each city,
The head of the computer centre, after out of four candidates P, Q, R and S. the
studying carefully the programmers to be monthly business depends upon the city and
developed, estimates the computer time in effectiveness of the branch manager in that
minutes required by the respective experts to city.
develop the application programmes as City
follows: Branch
A B C D
Programmers Manager
Progra- Monthly business (Rs. lakhs)
1 2 3 4 P 11 11 9 9
mmers
(Time in minutes) Q 13 16 11 10
A 120 100 80 90 R 12 17 13 8
B 80 90 110 70 S 16 14 16 12
C 110 140 120 100 Which manger should be appointed at which
D 90 90 80 90 city so as to get minimize total monthly
How the head of computer centre assign the
business?
programmers to the programmers so that the
total time required is minimum?
6) Five different machines can do any of the five
required jobs, with different profits resulting
3) A Workshop has four machines and four task from each assignment as shown below:
for completion. Each of the machines can Machines
perform each of the four tasks. Time taken at
Jobs A B C D E
each of the machines to complete each task is
given in the matrix given below: Profits (in Rs.)
1 30 37 40 28 40
Machines
2 40 24 27 21 36
Task A B C D
3 40 32 33 30 35
Processing time (Hrs.)
4 25 38 40 36 36
I 51 80 49 62
5 29 62 41 34 39
II 32 39 59 75
Find out maximum profit possible through?
III 37 49 70 61
IV 55 60 58 62
7) The following matrix shows the time in hours
taken by fie mechanics A, B, C and D and E
PANCHAKSHARI’S PROFESSIONAL ACADEMY PVT LTD

while working on five lathe machines M1, M2, C 1 2 - 2


M3, M4 & M5 in completing a certain job. How D 2 4 3 -
should, the foreman, assign the machines to
11) A company has one surplus car each in cities
mechanics so that the total time may be
P, Q, R and S and one deficit car each in cities
minimized?
A, B, C and D. the distances in kilometers
Machines between he cities are shown below:
Machines
M1 M2 M3 M4 M5 To
A 1 3 2 8 6 From
A B C D
B 2 4 3 1 5 P 8 5 8 2
C 5 6 3 4 6 Q 9 3 6 9
D 3 1 4 2 2 R 4 10 7 4
E 1 5 6 5 4 S 3 5 6 1
The management wishes to determine the
8) A departmental head has three subordinates
assignment of surplus car to the cities with a
and four tasks for completion. The employees
deficit to minimize the total kilometers
differ in their work contents. With the
performance matrix given below, which three traveled. Give alternate optimal assignment if
of the four tasks should be assigned to the possible. Compute the total distance for
subordinates? optimum assignment.
Subordinates
Tasks
I II III 12) A department head has four subordinates and
A 9 12 11 four tasks have to be performed. Subordinates
differ in efficiency and tasks differ in their
B 8 13 17
intrinsic difficulty. The time required by each
C 20 12 13 subordinates to perform each task is given in
D 21 15 17 the following effectiveness matrix. How the
tasks should be allocated to each person so as
to minimize the total man-hours?
9) In the modification of plant-layout of a
factory four new machines M1, M2, M3 and M4 are Subordinates
to be installed in machine shop. There are five
Tasks
1 2 3 4
vacant places A, B, C, D and E available. Due to
A 8 26 17 11
limited space, machine M2 cannot be placed at C
and machine M3 cannot be placed at A. the cost of B 13 28 4 26
locating of various machines in various vacant C 38 19 18 15
places is given in the following cost matrix (in Rs.). D 19 26 24 10
Find the optimal assignment schedule.
Places 13) A car hire company has one car at each five
Machines depots I, II, III, IV and V. a customer requires a
A B C D E
car in each town namely A, B, C, D, E. distance
M1 9 11 15 10 11 between deposits (in kms) and towns are
M2 12 9 - 10 9 given in the following distance matrix.
M3 - 11 14 11 7
Depots
M4 14 8 12 7 8 Towns
A B C D E
A 160 130 175 190 200
B 135 120 130 160 175
10) Solve the following restricted assignment
C 140 110 155 170 185
problem to minimize the overall effectiveness.
D 50 50 80 80 110
Job E 55 35 70 80 105
Persons
1 2 3 4
How should cars be assigned to customers so
A - 2 2 5
as to minimize the total distance traveled?
B 2 - 4 4

You might also like