In: Operations Management
Consider an assignment problem, assigning jobs to workers and one worker can work on only one job. The following table shows the time, unit in minutes, which the worker can finish the job. What is the objective function value, which is the minimum time (in minutes) to finish all jobs? Be careful with data inputs as you run the software program.
Worker 1 |
Worker 2 |
Worker 3 |
|
Job 1 |
12 minutes |
17 |
19 |
Job 1 |
15 |
12 |
18 |
Job 1 |
16 |
15 |
13 |
The Initial Matrix is:
Solver Parameters:
Constraints are:
Each job should be done by only 1 worker. Hence assigned should be more than or equal to 1
Each worker can also do 1 work.
Also, the allotment of a worker to a job will either be done or not. Hence decision variables are binary.
Optimal Solution:
Hence:
Job1 by Worker 1
Job 2 by worker 2
Job 3 by worker 3
Total time is 37 minutes.
********
IF YOU HAVE ANY DOUBT, KINDLY COMMENT. I WOULD LOVE TO HELP YOU!!!
IF YOU LIKE THE ANSWER, PLEASE GIVE AN UP-VOTE OR THUMB UP. THIS WILL ENCOURAGE ME TO ANSWER MORE!!