CMA Intermediate · Operations Management and Strategic Management · Job Evaluation, Job Allocation - Assignment
Workers A, B and C are to be assigned to Jobs 1, 2 and 3 (one each). Costs in ₹ hundred are: A: 8, 6, 10; B: 9, 7, 12; C: 6, 5, 11 (for Jobs 1, 2, 3 respectively). Worker A cannot be assigned Job 3. What is the minimum total cost (₹ hundred)?
The minimum cost is ₹24 hundred. Excluding every arrangement that gives Worker A Job 3, the feasible totals are 26, 25, 26 and 24. The cheapest is A to Job 2, B to Job 3 and C to Job 1. The unrestricted optimum of 23 is not allowed.
- A23
- B24Correct
- C25
- D26
Explanation
Of the six possible assignments, those with A on Job 3 are excluded (costs 24 and 23). The remaining totals are 26, 25, 26 and 24. The minimum is 24, from A-Job 2, B-Job 3, C-Job 1 (6+12+6). The value 23 is the unrestricted optimum, which uses the forbidden A-Job 3.
Did you get it right without looking?
One question tells you little. A timed set on Job Evaluation, Job Allocation - Assignment shows your real accuracy, how long you take and where you lose marks.
More Job Evaluation, Job Allocation - Assignment questions
- Three machines M1, M2, M3 are to be allotted to three jobs J1, J2, J3 (one each). Costs in ₹ thousand: M1: 8, 6, 10; M2: 9, 7, 5; M3: 4, 11,…
- A firm has 4 jobs but only 3 machines, and each machine can take exactly one job. Cost of each job-machine pair is known. What is the standa…
- To solve a maximisation assignment problem with the Hungarian method, a profit matrix has a largest element of ₹25 thousand. What is the con…
- A firm has 3 workers and 4 jobs, with a cost matrix given. To solve it with the Hungarian method, and given that one job will remain unassig…
- In the Hungarian method for a balanced minimisation assignment problem, what is the first step applied to the cost matrix?
- A firm has four workers W1 to W4 and three jobs J1 to J3, each job needing one worker and each worker doing at most one job. Costs (₹ thousa…