Omega Airlines has several nonstop flights between Atlanta and Los Angeles every day. The schedules of these flights are shown in the following table.

Omega wants to determine the optimal way of assigning flight crews to these different flights. The company wants to ensure that the crews always return to the city from which they left each day. FAA regulations require at least one hour of rest for flight crews between flights. However, flight crews become irritated if they are forced to wait for extremely long periods of time between flights, so Omega wants to find an assignment of flight schedules that minimizes these waiting periods.
a. Draw a network flow model for this problem.
b. Implement the problem in a spreadsheet and solve it.
c. What is the optimal solution? What is the longest period of time that a flight crew has to wait between flights, according to your solution?
d. Are there alternate optimal solutions to this problem? If so, do any alternate optimal solutions result in a smaller maximum waiting period betweenflights?

Transcribed Image Text:

Flight ecnt ra. Arrives in L.A. Departs Arrive in Atlanta Flight L.A 5 am 6 am 9 am Noon 2 pm 5 pm 7 pm Atlanta 9 am 10 am 1 pm 4 pm 6 pm 9 pm 11 pm 6 am 10 am Noon 10 am 4 pm 6 pm 7 pm 6 pm 8 pm 9 pm