LP Model: Variables Objective: 8-3: Restaurant work scheduling problem The famous Y. S. Chang Restaurant is open 24 hours a day. Waiters and busboys report for duty at 3 a.m., 7 a.m., 11 a.m., 3p.m., 7 p.m., or 11 p.m., and each works an 8-hour shift. The table below shows the minimum number of workers needed during the six periods into which the day is divided. Chang's scheduling problem is to determine how many waiters and busboys should report for work at the start of each time period to minimize the total staff required for one day's operation. (Hint: Let X equal the number of waiters and busboys beginning work in time period i, where i = 1, 2, 3, 4, 5 and 6. A) Create the LP model for this problem in the textbox to the right. B) Complete the spreadsheet for this problem below. C) Use Solver to find the optimal solution. D) What is the optimal schedule? Constraints: Decision Overlap Period 1 2 3 4 5 6 Time Number Required 3 am - 7 am 7 am - 11 an 12 11 am - 3 pn 16 3 pm - 7 pm 9 7 pm - 11 pn 11 11 pm - 3 an 4 Answer to Question D 12 16 9 11 4 3 3 Blue cells are for data Green cells are constraints that need formulas Orange cell is for objective that needs formula Yellow cells are for decision variables which are blank