Joe Fix plans the repair schedules each day for the Freeway Airline. Joe has 3 planes in need of repair and 5 repair personnel at his disposal. Each plane requires a single repairperson, except plane 3, which needs 2 personnel. Anyone not assigned to maintaining an airplane works in the maintenance shop for the day (not modeled). Each repairperson has different likes and dislikes regarding the types of repairs they prefer. For each plane, Joe has pulled the expected maintenance and determined the total preference matrix for his repair personnel. The preference matrix is:
|
|
Plane 1
|
Plane 2
|
Plane 3
|
|
Repair Person 1
|
11
|
9
|
21
|
|
Repair Person 2
|
17
|
7
|
13
|
|
Repair Person 3
|
9
|
12
|
17
|
|
Repair Person 4
|
14
|
8
|
28
|
|
Repair Person 5
|
12
|
5
|
12
|
Draw the balanced network flow for this assignment problem assuming Joe would like to maximize the total preference in his worker-to-aircraft schedule.
Formulate the LP for Joe assuming he wishes to maximize the total repairperson to plane assignment preferences.