|
|
Network Flow Programming Models |
|
-
Contractor Job Assignment |
|
A contractor has five jobs to be done during the next week. Two
workers are available for the jobs and each must do two in the
week. The profit for each job depends on the worker assigned as
shown in the table below. The problem is to select the jobs and
assign the workers to maximize total profit. Some jobs may not
be assigned in your solution, but we require that job 4 must be
done.
Job Profits
|
|
Job
|
|
|
1
|
2
|
3
|
4
|
5
|
Worker
|
1
|
3
|
9
|
7
|
3
|
10
|
|
2
|
5
|
6
|
10
|
5
|
15
|
|
|