Skip to main content

Client: Captain Charles M. Tiffin, Commander, Planning and Research Division, Durham Police Department

Student Consultant: Joseph R. Sherman, Operations Research Department, UNC-CH

Date: April 1997

Executive Summary

The Durham Police Department (DPD) would like to improve its Uniform Patrol Bureau (UPB) shift scheduling system. The UPB is currently organized into four platoons. Each platoon is made up of a squad from each of four stations. Platoons are scheduled so that each day one platoon works the day shift, one works the night shift and two are off duty. Shifts are 12 hours long, begin and end at 6 pm and 6 am, and a 12 hour rest period must take place between consecutive shifts. In a 28-day period, each platoon works seven day shifts, seven night shifts and has 14 days off duty. Officers do not work more than three consecutive shifts of either type, nor do they have more than three consecutive days off.

This scheduling arrangement produces a great deal of officer fatigue, primarily because of the number of times an officer completes a sequence of night shifts, forcing a change back to a daytime routine, and the short off-duty sequences required by the current schedule. In addition, shifts now change at a time of peak demand for police service and the rotating shift assignments fail to accommodate those officers with special family needs who would benefit from a weekday-only work schedule. Not only do officers point out the difficulties with the present schedule, but a recently concluded management audit of the DPD recommends “reconsideration of the shift rotation schedule and that consideration be given to developing a schedule that achieves efficiency and effectiveness of operations, while meeting the needs of the staff in a reasonable manner.” That is the underlying purpose of this study.

The primary goal, which is solved mathematically, is to:

  • Determine a rotating shift schedule that will reduce officer fatigue

The secondary goals are to:

  • Develop a method to accommodate those officers with special scheduling needs
  • Incorporate shift changes into the schedule at off-peak demand times.

The study presents solutions to the primary problem, subject to satisfying the constraints:

  • costs must remain at the present level
  • officers must not be expected to work more than 168 hours per month
  • each officer must work the same number of day and night shifts as every other
  • each officer must be guaranteed two weekends off per month
  • officers must be able to schedule court appearances during their regular shifts between 9 – 11 am or 2 – 4 pm on weekdays
  • supervisors must be paired with the same patrol officers for every shift because of chain of command requirements.

The primary goal is met using mathematical programming, a standard operations research technique that allows the user to achieve a goal in an “optimal” fashion while meeting all constraints. Analysis of this goal is augmented by a statistical analysis of calls for police service. The secondary goals are not dealt with in the mathematical program, but the study offers useful insights into their precise solution. The technique of integer programming, which further restricts its solutions to “whole numbers”, is used in this study to achieve the primary goal. That goal, called the objective, is to minimize officer fatigue as measured by the fatigue index. Limits, called constraints, are imposed in the form of the work-hour and other requirements already described. Variables are defined for each platoon (A,B,C,D), the type of shift (d = day-shift, n= night-shift, o = off-duty), the shift start day (1…28 where day 1 is a Monday), and the duration (d and n range from 2 to 4 days, o ranges from 1 to 7). Each variable has two possible values: 1 indicating the condition represented by the variable does occur in the solution, 0 indicating it does not. For example, if Ad3,3 =1, then platoon A works three consecutive day shifts beginning on day 3. Fatigue is minimized in the problem by minimizing the fatigue index, the sum of fatigue penalties assigned to each variable with a value of 1 in the solution. A solution consists of a list of all variables and their values and is called optimal if it achieves the lowest possible value for the objective.

The study considers and solves 20 different scenarios which differ in the number of consecutive shifts or days off they allow. The first group of five scenarios allows only two and three consecutive day or night shifts and from (1) one to three, (2) one to four, (3) one to five, (4) one to six, and (5) one to seven consecutive days off. Five more allow two, three, or four consecutive shifts and the same off-day sequences as the first five. The second group of ten is identical to the first, except a penalty is added to prevent one undesirable sequence found in the first group’s solutions, namely a sequence of night shifts followed by a single off day followed by a sequence of day shifts. In all cases, the study assumes the UPB is still organized into four platoons working 12-hour shifts with shift changes at 6 am and 6 pm daily. These characteristics were dictated by the cost constraints mentioned previously.

Solutions to the 20 scenarios fit into three classes. All those in a class achieved the same value for their fatigue indices (objective functions). In particular, 12 achieved the value of 732 which matches the fatigue index of the schedule now in use, six achieved the value of 608, and two achieved the value of 488, a value that matches a well-liked schedule used several years ago by the DPD known as the DuPont schedule. In principle, those with smallest fatigue index, namely 488, are preferable to the remaining scenarios. They include the maximum number of consecutive shifts (4) and days off (7) allowed in any of the scenarios. All schedules meet all staffing, work-hour and cost requirements while giving the department a group of schedules to choose from to match community policing and public image needs.