Seers Service Center schedules its daily repair visits to customers. The matrix ‘Tij ‘ below gives the travel time (in minutes) between the service center (row 1 and column 1)

and seven jobs. The jobs are assigned to one of the repairpersons during an 8-hr shift.

At the end of the day, the repairperson returns to the service center to complete paperwork.

‘Tij ‘ = ®

0 20 15 19 24 14 21 11 20 0 18 22 23 22 9 10 15 18 0 11 21 14 32 12 19 22 11 0 20 27 18 15 24 23 21 20 0 14 25 20 14 22 14 27 14 0 26 17 21 9 32 18 25 26 0 20 11 10 12 15 20 17 20 0



(a) Compare the lower bounds on the optimum tour length using both the assignment model and linear programming. Is the assignment model solution optimum for the TSP?

(b) Given that journeying between jobs is nonproductive and assuming a 1-hr lunch break, determine the maximum productivity of the repairperson during the day.