Question

Braneast Airlines must staff the daily flights between New York and Chicago shown in Table 81. Each of Braneast's crews lives in either New York or Chicago. Each day a crew must fly one New York-Chicago and one Chicago-New York flight with at least 1 hour of downtime between fights Braneast wants to schedule the crews to minimize the total downtime. Set up an assignment problem that can be used to accomplish this goal. (Hint: Let xij 1 if the crew that flies flight i also flies flight j, and xij = 0 otherwise. If.xij = 1, then a cost Cij is incurred, corresponding to the downtime associated with a crew flying flight i and flightj.) Of course, some assignments' are not possible. Find the flight assignments that minimize the total downtime. How many crews should be based in each city? Assume that at the end of the day, each crew must be in its home city TABLE 81 Leave Arrive Arrive New York Flight Leave New York Flight Chicago Chicago

Answer 1

Fiht No. Leave Anve Lae Ny Chi lo AM I PM Pry チPn4 9 PN I PN AM BAM lo AM 9AM! 1o A 12 Noow o AM 12 Noon 2.PM 5 PN 6 PM 2 PM clownticoe % mondatot İh': Fox Cren based in chicago 2 2 4 2 23 3 20 22 2 14 19 21 15 1구 19 al 2 18 18 4 12 13 1 5 25 5 lO 13 3 15 1 12 14 16 18

-The downtime matris Pormulared b g the ahePerunce between Ny-Arival the crenw who eside in ca lcula tin and NY-Deparbure Chicoyo Also cons idlenng the compuision of ih downtime . Similan y for Cren based in Ny 5 43 8 lo aoQ3 25 3 18 4 3 5 4 16 q s 4 20 -8 22 23 3 5 3 23 21 23 2. o 13 16 9 2 23 24 ing tha mimum values fo each Combinations and Pormulizing anothes mabox C - For chicago creno

오 2 18 9 3 15 4 12 3 89 1 5 t 8 12 IA 16 Followim the Hungamian Merhod lo optimal asshnm Row ReducbionTakirg the minimum value and pom other values of substracting the row 3 19 2oo 24 6 (2 is min 1 3 lo 12 14 12 14 o 1 2.

θ Column Reduction:. Subsbachn, tau, mnmum value of coluron Prom other alues the column 12 2. 2 Now Por frasible solut ion , the matix should Cover maximum number oF zeros with minimum lines e, No. of tolumns No. o lines There come out to be 6 lines hence it is a geasible sol ution Nono taking the minimum value yom uncovered Values, substracting it with uncovercol values and addine it to the values at junct%n 2. is the inimum uncovered value

1 ほ-오 17-2 오-2 l 3 5t 2 5 12 2. Applying same method ol leasibilsty check 2 19 5 is the minimum uncoveres value non

--) 12 261 12 6니 0565 64.0 @ 000 ) so e 撞 1 2. (오 H2. 12 56 I( 2 l6 3201 1 11 16 42才5 tt と 18 1,2 6 60000 No of lines-7 · uence optoma solution s 丄234 Now assign ments needed to be made 11x each 3y56구 l2 11 (2 16 18 12 6 3tligab