Scribd
Upload
7 views

Assignment Problems

N/A

Uploaded by

sajithsreerag
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
7 views

Assignment Problems

N/A

Uploaded by

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

Assignment Problem

Q1. A solicitors Firm employs typists on hourly price rate basis for their daily
work. There are five typists for service and their charges and speeds are different.
According to an earlier understanding, only one job is given to one typist and typist
is paid for full hour even if he works for a fraction of ah hour.

Find the least cost of allocation for the following data.

Typist Rate per hour No. of pages Job No. of Pages


in Rs. typed per hour
Aman 5 12 A 190
10Raman 6 14 B 170
Vaman 3 8 C 145
Chaman 4 10 D 190
Dhaman 4 11 E 180

Q2. A College head of Dept has to provide teachers to all courses offered by his
dept for imparting highest possible quality of education. He has got three
professors and one teaching Assistant (TA ). Four fourses must be offered. After
detailed analysis and evaluation, the head of the dept. has arrived at the following
relative ratings (100= best rating) regarding the ability of each instructor to teach
each of the four courses respectively.
Course 1 Course 2 Course 3 Course 4
Professor 1 60 40 60 20
Professor 2 20 60 50 70
Professor 3 20 30 40 60
TA 30 10 30 40

How should the head of dept. assign his staff to the course to optimize educational
quality in his dept.

Q3. A company has four salespersons (S1, S2, S3, S4) and four regions (R1, R2,
R3, R4) where they need to be assigned. The sales generated (in thousands) if
each salesperson is assigned to each region is given in the table below. The
company wants to maximize the total sales by assigning each salesperson to
one region. Solve the assignment problem.
| | R1 | R2 | R3 | R4 |
|-------------|-----|-----|-----|-----|
| **S1** | 20 | 28 | 30 | 24 |
| **S2** | 26 | 20 | 24 | 22 |
| **S3** | 22 | 28 | 26 | 30 |
| **S4** | 24 | 32 | 30 | 28 |

Q4. A factory has 4 machines (M1, M2, M3, M4) and 4 jobs (J1, J2, J3, J4). The
time taken (in hours) to complete each job on each machine is shown in the
table below. However, some jobs cannot be assigned to certain machines due
to technical restrictions (prohibited assignments are marked as "—"). The goal
is to assign each job to one machine in such a way that the total time is
minimized.

| | J1 | J2 | J3 | J4 |
|-------------|-----|-----|-----|-----|
| **M1** | 9 | 11 | — | 10 |
| **M2** | 12 | — | 14 | 10 |
| **M3** | — | 8 | 12 | 13 |
| **M4** | 11 | 10 | 13 | — |

### Prohibited Assignments:


- M1 cannot do J3
- M2 cannot do J2
- M3 cannot do J1
- M4 cannot do J4

You might also like