Answer Happy

Wichita's famous Sethi Restaurant is open 24 hours a day. Servers report for duty at 3 A.M., 7 A.M., 11 A.M., 3 P.M., 7 P.M., or 11 P.M., and each works an 8-hour shift. The following table shows the minimum number workers needed during the 6 periods into which the day is divided: Decision vairable: X, number f workers reporting for the start of working period i, where i = 1, 2, 3, 4, 5, or 6. Objective function: Minimize Z= Subject to: X₁ + X₂ +X3 + X4 +X5+X5 Period 1 2 3 Owner Avanti Sethi's scheduling problem is to determine how many servers should report for work at the start of each time period in order to minimize the total staff required for one day's operation. (Hint: Let X, equal the number of servers beginning work in time period i, where i = 1, 2, 3, 4, 5, 6.) X₁ + X3 215 X₂ + X6 218 X3 + X3 212. (7 A.M.-11 A.M.) (11 A.M. -3 P.M.) (3 P.M.-7 P.M.) 4 5 6 17 DM - 11 DM) Time 3 A.M. -7 A.M. 7 A.M.-11 A.M. 11 A.M.-3 P.M. 3 P.M.-7 P.M. 7 P.M.-11 P.M. 11 P.M.-3 A.M. Number of Servers Required 3 15 18 12 14 3 Next
Objective function: Minimize Z= Owner Avanti Sethi's scheduling problem is to determine how many servers should report for work at the start beginning work in time period i, where /= 1, 2, 3, 4, 5, 6.) Subject to: X₁ + X₂ + X3 + X₁ + X5 + X6 X₁ + X3 215 X₂+ X218 X3 + X3 212. X4+ X₂ 214 (7 A.M. - 11 A.M.) (11 A.M. - 3 P.M.) (3 P.M. -7 P.M.) (7 P.M. - 11 P.M.) (11 P.M. - 3 A.M.) (3 A.M. -7 A.M.) 5 X5 + X₂ 23 X6 + X3 23 For all X, 20 The optimal solution results in total workers = [3] (enter your response as a whole number). 7 P.M.-11 P.M. 11 P.M. - 3 A.M. each time period in order to minimize the total staff required for one day's operation. (Hint: Let X, equal the number of servers. 14 3