Advertisements
Advertisements
Question
Give mathematical form of Assignment problem
Advertisements
Solution
Consider the problem of assigning n jobs to n machines (one job to one machine).
Let Cij be the cost of assigning ith job to the jth machine and xij represents the assignment of ith job to the jth machine.
Then, xij = `{{:(1",", "if" "i"^"th" "job is assigned to" "j"^"th" "machine"),(0",", "if" "i"^"th" "job is assigned to" "j"^"th" "machine"):}`
| Machines | ||||||
| 1 | 2 | … | n | Supply | ||
| 1 | `""^((x_11))"C"_11` | `""^((x_12))"C"_12` | … | `""^((x_(1n)))("C"_(1n))` | 1 | |
| 2 | `""^((x_21))"C"_21` | `""^((x_22))"C"_22` | … | `""^((x_(2n)))("C"_(2n))` | 1 | |
| Jobs | : | : | : | : | 1 | |
| m | `""^((x_"ij"))"C"_("n"1)` | `""^((x_(m2)))"C"_("n"1)` | … | `""^((x_"ij"))("C"_"nn")` | 1 | |
| Demand | b1 | b2 | … | bn | ||
xij is missing in any cell means that no assignment is made between the pair of job and machine.
i.e xij = 0.
xij is presents in any cell means that an assignment is made their.
In such cases xij = 1
The assignment model can written in LPP as follows:
Minimize Z = `sum_("i" = 1)^"m", sum_("j" = 1)^"n" "C"_"ij" "X"_"ij"`
Subject to the constrains
`sum_("i" = 1)^"n" "X"_"ij"` = 1, j = 1, 2, …. n
`sum_("i" = 1)^"n" "X"_"ij"` = 1, i = 1, 2, …. n and xij =0 or 1 for all i, j
APPEARS IN
RELATED QUESTIONS
A departmental head has three jobs and four subordinates. The subordinates differ in their capabilities and the jobs differ in their work
contents. With the help of the performance matrix given below, find out which of the four subordinates should be assigned which jobs ?
| Subordinates | Jobs | ||
| I | II | III | |
| A | 7 | 3 | 5 |
| B | 2 | 7 | 4 |
| C | 6 | 5 | 3 |
| D | 3 | 4 | 7 |
Choose the correct alternative:
The assignment problem is said to be balanced if ______
In an assignment problem if number of rows is greater than number of columns, then dummy ______ is added
What is the Assignment problem?
A departmental head has four subordinates and four tasks to be performed. The subordinates differ in efficiency and the tasks differ in their intrinsic difficulty. His estimates of the time each man would take to perform each task is given below:
| Tasks | |||||
| 1 | 2 | 3 | 4 | ||
| Subordinates | P | 8 | 26 | 17 | 11 |
| Q | 13 | 28 | 4 | 26 | |
| R | 38 | 19 | 18 | 15 | |
| S | 9 | 26 | 24 | 10 | |
How should the tasks be allocated to subordinates so as to minimize the total manhours?
Choose the correct alternative:
North – West Corner refers to ______
Choose the correct alternative:
The purpose of a dummy row or column in an assignment problem is to
Choose the correct alternative:
The solution for an assignment problem is optimal if
A natural truck-rental service has a surplus of one truck in each of the cities 1, 2, 3, 4, 5 and 6 and a deficit of one truck in each of the cities 7, 8, 9, 10, 11 and 12. The distance(in kilometers) between the cities with a surplus and the cities with a deficit are displayed below:
| To | |||||||
| 7 | 8 | 9 | 10 | 11 | 12 | ||
| From | 1 | 31 | 62 | 29 | 42 | 15 | 41 |
| 2 | 12 | 19 | 39 | 55 | 71 | 40 | |
| 3 | 17 | 29 | 50 | 41 | 22 | 22 | |
| 4 | 35 | 40 | 38 | 42 | 27 | 33 | |
| 5 | 19 | 30 | 29 | 16 | 20 | 33 | |
| 6 | 72 | 30 | 30 | 50 | 41 | 20 | |
How should the truck be dispersed so as to minimize the total distance travelled?
A department store has four workers to pack goods. The times (in minutes) required for each worker to complete the packings per item sold is given below. How should the manager of the store assign the jobs to the workers, so as to minimize the total time of packing?
| Workers | Packing of | |||
| Books | Toys | Crockery | Cutlery | |
| A | 3 | 11 | 10 | 8 |
| B | 13 | 2 | 12 | 12 |
| C | 3 | 4 | 6 | 1 |
| D | 4 | 15 | 4 | 9 |
