An airline crew assignment

An airline that operates 7 days a week has a time table shown below. Crews must have a minimum
layover of 6 hours between flights. Obtain the paring of flights that minimizes layover time away from
home. For any given pairing the crew will be based at the city that results in the smaller layover

Flight No Delhi Calcutta Flight No Calcutta Delhi

Departure Arrival Departur Arrival
e
101 7am 9am 201 9am 11am
102 9am 11am 202 10am 12 noon
103 1.30pm 3.30 pm 203 3.30 pm 5.30 pm
104 7.30pm 9.30 pm 204 8pm 10pm

An airline operates 7 days week has a time table shown below

Here at first we have to get matrix based on the layover time (in hrs).

The layover time is the time gap( rest time) between arrival time to Bangalore and departing time from
Bangalore.....

If the difference between he times is less than 6 hrs departure is taken to begin next day only

Flight No Calcutta based Delhi Based

201 202 203 204 201 202 203 204
101 0 1 6.5 11 20.5 19 13.5 9
102 22 23 4.5 9 22 21 15.5 11
103 17.5 18.5 0 4.5 2.5 1.5 20 15.5
104 11.5 14.5 18 22.5 8 7.5 2 21.5
Given condition that the minimum layover time must be 6 hrs.If any element in the above matrix less
than 6 add 24 along with this

Modified layover matrix is

Flight No Calcutta based Delhi Based

201 202 203 204 201 202 203 204
101 24 25 6.5 11 20 19 13.5 9

102 22 23 28.5 9 22 21 15.5 11

103 17.5 18.5 24 28.5 26.5 25.5 20 15.5
104 11.5 12.5 18 22.5 8.5 7.5 26 21.5

The composite layover time matrix can be written by selecting the minimum layover corresponding
positional elements of the above matrix.

201 202 203 204

101 20 19 6.5 9
102 22 21 15.5 9
103 17.5 18.5 20 15.5
104 8.5 7.5 18 21.5

Since the objective to minimize the overall layover time, we apply the Hungarian method for the latest
matrix

Ans:

The required optimum flight schedule is

Flight Base of the crew Laover time in hrsy

101----203 Bangalore 6.5
102----204 Bangalore 9.0
103----201 Bangalore 17.5
104----202 Delhi 7.5
Total lay ovr time is 40.5 hrs.
Solve the following problem to maximize the profit. Which job is to be left

62 78 50 101 82
71 84 55 73 59
87 92 111 71 81
48 64 87 77 80
Ans:376

A manager has 4 salesmen and four sales districts. He estimates that the profit pr day fromeach
salesmen in each districts would be as follows

Find the assignment of salesmen to districts that will result in maximum profit

33 21 35 23

29 23 37 31

31 31 33 29

27 25 35 37

Ans:138