# Linear Programming Minimization Model

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., 3 p.m., 7 p.m., or 11 p.m., and each works an eight hour shift. the following table shows the minimum number of workers needed during the six periods into which the day is divided.

PERIOD | TIME | NUMBER OF WAITERS & BUSBOYS REQUIRED

1 3 a.m.- 7 a.m. 3

2 7 a.m.- II a.m. 12

3 II a.m.- 3 p.m. 16

4 3 p.m.- 7 p.m. 9

5 7 p.m.- II p.m. II

6 II p.m.- 3 a.m. 4

Chang's scheduling problem is to determine how many waiters and busboys should report for work at the start of each time period in order to minimize the total staff for one day's operation. Formulate a linear programming model for this problem. (Do not attempt to solve.)

© BrainMass Inc. brainmass.com October 10, 2019, 1:49 am ad1c9bdddfhttps://brainmass.com/math/linear-programming/linear-programming-minimization-model-350264

#### Solution Summary

A linear programming model if formulated for this problem in a page-long attached Word/PDF document.