In: Statistics and Probability
The Clark County Sheriff’s Department schedules police officers for 8-hour shifts. The beginning times for the shifts are 8:00 a.m., noon, 4:00 p.m., 8:00 p.m., midnight, and 4:00 a.m. An officer beginning a shift at one of these times works for the next 8 hours. During normal weekday operations, the number of officers needed varies depending on the time of day. The department staffing guidelines require the following minimum number of officers on duty:
Time of Day | Minimum No. of Officers on Duty | |
8:00 a.m.–noon | 5 | |
Noon–4:00 p.m. | 6 | |
4:00 p.m.–8:00 p.m. | 7 | |
8:00 p.m.–midnight | 7 | |
Midnight–4:00 a.m. | 4 | |
4:00 a.m.–8:00 a.m. | 6 |
Determine the number of police officers that should be scheduled to begin the 8-hour shifts at each of the six times to minimize the total number of officers required. (Hint: Let x1 = the number of officers beginning work at 8:00 a.m., x2 = the number of officers beginning work at noon, and so on.) If your answer is zero, enter “0”.
Starting Time | Officers Starting | |
8:00 a.m. | ||
Noon | ||
4:00 p.m. | ||
8:00 p.m. | ||
Midnight | ||
4:00 a.m. |
Let x1 = the number of officers beginning work at 8:00 a.m.,
x2 = the number of officers beginning work at noon
x3 = the number of officers beginning work at 4:00 p.m.,
x4 = the number of officers beginning work at 8:00 p.m.
x5 = the number of officers beginning work at mid-night,
x6 = the number of officers beginning work at 4:00 a.m.
We need to solve the following set of equations:
Minimize x1 + x2 + x3 + x4 + x5 + x6
subject to constraints: x6 + x1 >= 5
x1 + x2 >= 6
x2 + x3 >= 7
x3 + x4 >= 7
x4 + x5 >= 4
x5 + x6 >= 6
AND x1 >=0; x2 >= 0; x3 >= 0; x4 >= 0; x5 >= 0; x6 >= 0
Using the solver add-in in MS Excel, we get the following solution:
x1 =3; x2 = 3; x3 = 3; x4 = 4; x5 = 3; x6 = 3
We have the following table:
Starting Time | Officers Starting | |
8:00 a.m. | 3 | |
Noon | 3 | |
4:00 p.m. | 3 | |
8:00 p.m. | 4 | |
Midnight | 3 | |
4:00 a.m. | 3 | |