MPE Mathematical Problems in Engineering 1563-5147 1024-123X Hindawi Publishing Corporation 751563 10.1155/2014/751563 751563 Research Article Optimal Work Shift Scheduling with Fatigue Minimization and Day Off Preferences http://orcid.org/0000-0002-5293-162X Wang Ta-Chung Liu Cheng-Che Momoniat Ebrahim Institute of Civil Aviation National Cheng Kung University No. 1 University Road, Tainan City 701 Taiwan ncku.edu.tw 2014 1042014 2014 26 12 2013 10 03 2014 10 4 2014 2014 Copyright © 2014 Ta-Chung Wang and Cheng-Che Liu. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Shift work disrupts the sleep-wake cycle, leading to sleepiness, fatigue, and performance impairment, with implications for occupational health and safety. For example, aircraft maintenance crew work a 24-hour shift rotation under the job stress of sustaining the flight punctuality rate. If an error occurs during the aircraft maintenance process, this error may become a potential risk factor for flight safety. This paper focuses on optimal work shift scheduling to reduce the fatigue of shiftworkers. We proposed a conditional exponential mathematical model to represent the fatigue variation of workers. The fatigue model is integrated with the work shift scheduling problem with considerations of workers’ preferences of days off, company or government regulations, and manpower requirements. The combined problem is formulated as a mixed-integer program, in which the shift assignments are described by binary variables. Using the proposed method, we can find a feasible work shift schedule and also have a schedule that minimizes the peak fatigue of shiftworkers while satisfying their days off demands. Several examples are provided to demonstrate the effectiveness of the proposed approach.

1. Introduction

Fatigue-related problems cost America an estimated \$18 billion per year in terms of lost productivity, and fatigue-related drowsiness on the highways contributes to more than 1,500 fatalities, 100,000 crashes, and 76,000 injuries annually . As for aviation, 21% of all reported incidents (reported by both pilots and controllers) in the aviation safety reporting system (ASRS) are fatigue related . It is also known that 15% to 20% of all fatal traffic accidents are fatigue related . Fatigued drivers will cause substantial danger to the road safety . Nurses’ work patterns have also attracted much interest for the past 15 years. Most hospital nurses work extended hours, and long work hours are found to be a contributor to poor patient outcomes, such as errors and infections, and poor nurse outcomes, such as musculoskeletal and needle stick injuries . These show the importance of keeping a good working state to reduce accidents. Therefore, it is important to schedule an appropriate shift table that takes the reduction of fatigue into consideration.

To automatically arrange a feasible shift table, the scheduling problem is usually formulated as a constraint program. Berrada et al.  used both soft and hard constraints to describe the nurse shift-scheduling problem constraints. The hard and soft constraints are defined according to the importance of each constraint. The objective is to find high-quality shift assignments to meet nurses’ preferences. That is, the objective function measures how much the solution deviates from the soft constraints. Two different techniques, the sequential technique and the equivalent weights technique, are proposed to solve the nurse scheduling problem. Using similar formulations, Kundu and Acharyya  proposed a satisfiability approach to solve the nurse scheduling problem with comparisons with simulated annealing approach and genetic algorithm approach. Kim and Lee  considered the problem of managing work shift for nuclear power plants. The objective function is to minimize the work time differences among all employees, and a heuristic method is proposed to solve the problem. Human factors, such as work and rest time regulations, are considered in the constraints. da Silva et al.  used the mixed-integer programming to solve a power system maintenance scheduling problem. The objective was to select the safest plan for a generator’s outage schedule for the purpose of maintenance. The resulting schedule allowed reliable system operation. Silva developed a technique, which considers an optimal linearized set of power flow equations. The results show that representing transmission influence is essential for the establishment of a sound set of scheduled outages for the system’s generators. Leou  later added uncertainty considerations into the power system scheduling problem. A fuzzy 0-1 integer programming model is adopted to find the minimum violation solution. Tabari et al.  used similar model as Leou’s and solved the problem using enumeration-based 0-1 integer programming. All the above formulations focus on minimizing the violation of constraints or the work time difference of each person or machine. Therefore, the scheduling results may not reflect the fatigue imposed on the workers or machines. We first propose an exponential formulation of the fatigue variation that can be incorporated into an optimization problem . However, the formerly proposed model does not correctly reflect the variation of the fatigue when the workers are working under high fatigued states. Moreover, the previous formulation requires that the workers select their days off, which may render the problem infeasible. In this paper, we propose a revised formulation, which has better accuracy for workers being highly fatigued. Moreover, in the revised formulation, the workers can assign their respective preferences of days off and it allows the solver to select the best possible days off for each worker while satisfying all the government’s and/or companies’ regulations and manpower requirements.

This paper is structured as follows. In Section 2, we present the revised modeling of the fatigue. The days off selection mechanism is also presented. Then, in Section 3, various scheduling results were presented. The paper is then concluded in Section 4.

2. Problem Formulation 2.1. Revised Fatigue Modeling

To support employees being at proper alertness levels when working shifts, we predict the fatigue level of each employee. Fatigue is generally accepted to be under the influence of previous sleep history, time spent at work, and length of time spent awake . The research conducted by  also showed that, in addition to sleep length, wakefulness, and work hours, workload significantly influences fatigue. Therefore, in our model, both the effects of workload and work hours are considered. Pruchnicki et al.  suggested that mathematical models to predict fatigue can be useful retrospectively in accident analysis, if reliable sleep/wake histories are available for the related personnel. The mathematical model will also be useful prospectively in identifying the fatigue risk associated with different duties and schedules, hence enabling accident prevention through fatigue risk management. Dawson et al.  stated that because shift work is a common cause of sleep loss and fatigue, models that enable us to estimate fatigue on the basis of working hours are clearly of value. Biomathematical models of fatigue (BMMF) can be used to predict the effects of different working patterns on subsequent job performance, reflecting scientific data concerning the relations among work hours, sleep, and performance. BMMF could also be integrated into a range of individual monitoring devices, which may enhance the overall ability to detect fatigue. Some of the existing mathematical models are as follows: Fatigue Audit InterDyne (FAID) , the US Army’s sleep management system , and the three-process model of alertness .

To manage fatigue, we need to know how much fatigue people experience. Therefore, a fatigue model to represent and quantify the predicted fatigue levels is required before constructing the optimization problem. Our fatigue model is inspired by the FAID system. The FAID model is constructed by a linear component (length of work period) and a sinusoidal component (circadian timing of work period), which is nonlinear and, hence, is not suitable for constructing constraints in the shift-scheduling problem. The primary concept of FAID is to view a duty schedule as a time-varying function by which an individual is considered in one of the two states: work or nonwork. Each state can be considered as an input, from which a continuously varying fatigue/recovery result is the output. Figure 1 is the simulation for 88 hours of work and rest. In this figure, the worker repeats the schedule of working 12 hours, followed by 12 hours of rest. From the result, we observe that, although the workload of each day is the same, the fatigue level builds up faster when the worker is in a higher fatigue state. It can also be observed that the increment of fatigue at different period during work may be different. This reflects the differences of workload at different period.

The simulation results using FAID .

To address the aforementioned findings in the FAID result, in our previous work, we assume that the fatigue state of a worker is formulated as a first-order time-varying system as the following: (1) x i m = x i ( m - 1 ) exp ( T g i m ) = x i ( m - 2 ) exp ( T g i ( m - 1 ) ) exp ( T g i m ) = x i 0 exp ( T j = 1 m g i j ) , where g i j is the coefficient that indicates the fatigue increment or decrement of employee i during period j , x i m is the fatigue state of the i th employee at time m T , and T is the sampling period of the fatigue state. In the following, g i j will be called the workload coefficient of worker i at the j th period.

Although the fatigue model (1) is capable of exhibiting that fatigue builds up faster when the employee is in a higher fatigued state under the same workload and is able to reflect the workload variation during each shift, this model fails to track the fatigue variation at high fatigued states . To fix this problem, we proposed a revised fatigue dynamics with conditional weighting as the following: (2) x i m = x i 0 exp ( T j = 1 m g ~ i j ) ,                         g ~ i j = { g i j ϕ u , if    x i j > x u ,   g i j > 0 g i j ϕ l , if   x i j > x u ,   g i j < 0 g i j , otherwise .

In the revised dynamics, we conditionally modify the increment/decrement rate of fatigue when the fatigue state is higher than some prespecified state x u . Using this mechanism, the model can more accurately track the fatigue states at very high fatigue states. Figure 2 shows the comparison results with x u = 110 , ϕ u = 0.77 , and ϕ l = 1 / 0.77 . The workload coefficients are estimated using the least square error method based on the fatigue variation on the first day. The estimated coefficients are as follows: (3) [ - 0.109       - 0.135       - 0.012       - 0.060       - 0.075       0.104       0.274       0.068       0.136       0.041       0.041       0.041 ] .

Comparison of different fatigue models.

Then, the same workload coefficient is used repeatedly in the following days. The data of the original model are generated from (1), and the data of the revised model are based on (2). Clearly, the revised is much better than the original model.

Because the dynamic model shown in (2) is not linear with the workload coefficients, we take logarithms to x i m to obtain (4) ln x i m = ln x i 0 + T j = 1 m g ~ i j .

Then, ln x i m can be expressed as a linear function of the workload coefficients.

2.2. Days Off Preferences

Because of manpower and other requirements, employees usually will not be able to have their desired days off schedule. To make the scheduling problem feasible while trying to satisfy employees’ desired days off schedule, we first find all the possible days off schedule in a week and allow each employee to place the weightings on these days off selections based on their preferences. A lower weighting means that the selection is much preferred by the employee than the selections with higher weightings.

2.3. Optimal Shift-Scheduling Problem

To formulate the optimal shift-scheduling problem, we first estimate the workload coefficients for each employee working for all types off work shifts. This can be done by first using FAID to generate the fatigue variation results and then use the least square error method to estimate these coefficients and construct the work shift coefficient matrix (5) W = [ W 1 0 0 W 2 ] , where W i is the work shift coefficient matrix for worker i . The l th row of W i contains the workload coefficients of worker i performing the l th shift. We let the last row of W i be the workload coefficient when the worker has a day off on that day. For the days off schedule selection, let (6) W h = [ W h 1 T W h 2 T W h n T ] T be the days off combination matrix. The ( t , j ) th element of W h i is of value 0 or 1 , which represents whether worker i is working ( 0 ) or not working ( 1 ) on the j th day when choosing the t th days off schedule.

Consider a weekly scheduling problem with the following notations used in the formulation of the optimal weekly shift-scheduling problem.

The number of employees to be scheduled

The number of days off schedule from which the employee can choose

The total number of shift schedule including days off that can be assigned in one day

The total number of sampling points of fatigue states for each employee

The sampling period of the fatigue state

The least upper bound of the natural log of all employees’ fatigue state

A row vector whose elements all equal 1

A zero vector

The maximum allowed work hours per week

The hours of work when the employee is assigned the l th shift on the o th day

The manpower requirement during the work hour of the l th shift on the o th day

The set of shift assignments that has contribution to the manpower during the work hour of the l th shift on the o th day

A binary variable indicating whether employee i is assigned to the l th shift on the o th day

A binary variable indicating whether employee i is assigned to the t th days off schedule

The weighting coefficient ranging from 0 to 100 , indicating how much employee i dislikes to be assigned to the t th days off schedule

A matrix of binary value. Each column lists one disallowed combination of shifts in a week.

Incorporating the ideas shown in Section 2.1 and Section 2.2 with other work shift-related constraints, we get the following mixed-integer program: (7) min β , γ Y e + i = 1 n ( j = 1 m 1 ξ i j + t = 1 v ω i t γ i t ) (8) s . t . ln x i 0 + T j = 1 m ξ i j 1 Y e , (9) A ξ i j b i j , (10) β = β w + β h [ 0 0 0 0 0 0 1 ] , (11) β h = [ γ 1 W h γ 2 W h γ n W h ] , (12) g = β ( I 7 n W ) , (13) t = 1 6 γ i t = 1 , (14) l = 1 s β j l i = 1 , (15) i = 1 n l = 1 | β - o l | β - o l i M o l , (16) o = 1 7 ( l = 1 s β o l i h o l ) H w , (17) β ( I 7 n C s ) 1 (18) for i { 1,2 , , n } , j { 1,2 , , m } , l { 1,2 , , s } , t { 1,2 , , v } , where γ i is a row vector of length v , which contains the days off schedule selection result of the i th worker, and β w = [ β 11 1 β 12 1 β 1 ( s - 1 ) 1 0 β 7 ( s - 1 ) 1 0 β 11 2 β 7 ( s - 1 ) n 0 ] is the shift-scheduling decision variable matrix. The last shift selection for each employee is picked using β h , which is generated by γ i through (11). The resultant shift assignment is then constructed by (10). The vector g lists the resultant workload coefficient assignment before applying the conditional weighting. Constraints (13) and (14) ensure that only one day off assignment is selected for each employee, and every employee can only be assigned to one shift including the day off schedule. Presuming that adequate manpower is available, the manpower requirement is ensured using (15), and (16) limits the accumulated work hours in a week for each employee. In (17), C s is a matrix whose column lists the disallowed combination of two different shifts, for example, if the k th element in a column indicates a night shift of Monday and the w th element in the same column indicates a morning shift in the following day. Because the combination of these shifts is not legit, we set these elements as 1 and set other elements as 0 . An employee cannot be assigned both of these shifts because the summation would be 2 .

The terms ξ i j , A , and b i j in (7), (8), and (9) are used to implement the conditional weighting mechanism. The content of matrix A is (19) A = [ 1 1 1 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 0 0 0 0 1 1 0 0 0 1 1 0 0 0 0 1 0 0 0 0 0 0 1 1 0 0 0 1 0 0 0 0 0 0 0 1 1 ] T .

The elements of ξ i j are (20) ξ i j = [ ξ i j 1 ξ i j 2 ξ i j 3 ξ i j 4    ξ i j 5 ] T , (21) b i j = [ g i j ϕ u g i j ϕ l g i j Z ( ln x i j - ln x u ) 0 Z ( ln x u - ln x i j ) 0 - Z g i j 0 Z g i j 0 ] T ,

where Z is chosen as some very large number. The constraint (9) is as the following: (22) ξ i j 1 + ξ i j 3 + ξ i j 4 g i j ϕ u , (23) ξ i j 1 + ξ i j 3 + ξ i j 5 g i j ϕ l , (24) ξ i j 1 + ξ i j 2 + ξ i j 4 g i j , (25) ξ i j 2 Z ( ln x i j - ln x u ) , ξ i j 2 0 , ξ i j 3 Z ( ln x u - ln x i j ) , ξ i j 3 0 , ξ i j 4 - Z g i j , ξ i j 4 0 , ξ i j 5 Z g i j , ξ i j 5 0 . Combining with minimizing 1 ξ i j , we have the following.

If x i j > x u , then ln x i j > ln x u , ξ i j 2 0 , ξ i j 3 = 0 .

If x i j < x u , then ln x i j < ln x u , ξ i j 2 = 0 , ξ i j 3 0 .

If g i j > 0 , then ξ i j 4 = 0 , ξ i j 5 0 .

If g i j < 0 , then ξ i j 4 0 , ξ i j 5 = 0 .

Therefore, from (22), (23), and (24), we have (26) ξ i j 1 = { g i j ϕ u If x i j > x u , g i j > 0 g i j ϕ l If x i j > x u , g i j < 0 g i j If x i j < x u .

3. Simulation Results

In this section, we use two different scenarios to demonstrate the effectiveness of the proposed algorithm. The following examples are run on a personal computer with an Intel Core i5-2400 CPU and 4 GB of RAM. The solver we used is Xpress IVE Version 1.14.36. All the examples can be solved within 5 seconds.

3.1. Air Traffic Controller Shift Scheduling

Air traffic control is the process by which aircraft is directed by air traffic controllers (ATCs) to separate air traffic to prevent collisions. ATCs need to provide information to pilots while aircrafts are taxiing on the ground or flying in the air to keep the air traffic unimpeded and to enhance aviation safety. On the basis of the above requirements, air traffic control must be provided for 24 hours per day in many airports, which leads to controllers working in shifts.

In this simulation, we consider the scenario with the following conditions.

There are eight people to be scheduled.

The simulation period is seven days long.

Every employee has two days off during each week.

The morning shift cannot be scheduled right after a night shift.

All employees prefer to have days off during the weekend. If not possible, a consecutive two days off is preferred.

The optimized schedule has the same manpower requirement as the original schedule.

The possible shift times are as follows: 0700 1300 (A), 0800 1300 (B), 0900 1900 (C), 1000 1900 (D), 1300 1900 (E), 1300 2100 (F), 1300 2200 (G), 1900 0700 (H), 0700 1300 and 1900 0700 (I), 0800 1300 and 1900 0700 (J), and day off (O).

It should be noted that, in this scenario, shifts I and J are two allowable shift combinations in which an employee is assigned a morning shift and a night shift in a day. The original shift table is shown in Table 1, and the corresponding fatigue variation is shown in Figure 3. As can be seen in Table 1, because of the manpower limitation, none of the employees can have days off during the weekend. Moreover, only half of the employees can have consecutive days off. Figure 3 also shows that the fatigue states of these employees are not balanced. Some of the employees receive a fatigue state of nearly 75 , whereas some of the employees only have a fatigue state of less than 60 .

The original ATC shift table.

ATC Mon. Tue. Wed. Thu. Fri. Sat. Sun.
1 I A O C O C I
2 C F C I O O I
3 J O O A F C I
4 C G F I O O C
5 O E E O A A J
6 O J O J H H E
7 J O A G O J J
8 I O B H O I I

The fatigue states using the original ATC shift table.

We then apply the proposed algorithm to reschedule the shift table. The optimized shift table is shown in Table 2. The optimized shift also satisfies the same manpower requirement as in Table 1. However, in the optimized shift table, all the workers are assigned consecutive days off. Figure 4 shows the fatigue state of all the employees using the optimized schedule. It can be seen that the fatigue states aremore evenly distributed among all employees.

The optimized ATC shift table.

ATC Mon. Tue. Wed. Thu. Fri. Sat. Sun.
1 J O O I F C I
2 A I E O O C I
3 A B A J O O I
4 J O O G A J I
5 C G B I O O J
6 H F F O O I J
7 C E C C O O C
8 H O O I H I E

The fatigue states using the optimized ATC shift table.

3.2. Work-Study Students Shift Scheduling

In this simulation, we extract a work-study student shift table from the Internet and test the proposed method with the existing shift table. The following contains the settings of the simulation.

There are eight students to be scheduled.

The simulation period is seven days long.

Every student has two days off during each week.

All students desire to have consecutive days off during the week.

The optimized schedule has the same manpower requirement as the original schedule.

The possible shift times are as follows: 0800 1200 (A), 1200 1600 (B), 1600 1900 (C), 0800 1600 (D), 0800 1200 and 1600 1900 (E), 1200 1900 (F), 0800 1900 (G), and day off (O).

Table 3 lists the original schedule of these eight students, and Figure 5 shows the fatigue variation of students using the original shift schedule. As can be seen in Figure 5, these students are not properly scheduled because the fatigue states are not evenly distributed among all students. We then apply the proposed algorithm to this schedule and give each student an assumed preferred two-day consecutive days off. The resultant shift table is shown in Table 4. The most desired days off of each student is marked with parentheses. As can be seen in Table 4, not all students can have their preferred days off because of the manpower requirements. However, seven of eight students do have consecutive two days off during the week. Figure 6 shows the fatigue states of these students. Clearly, using the optimized schedule, the workload is much evenly distributed among students.

The original work-study student shift table.

Student Mon. Tue. Wed. Thu. Fri. Sat. Sun.
1 G G E O A O E
2 F E G G G O O
3 O G E A G B O
4 E O E G G O G
5 A O E G G O G
6 G G G E F O O
7 G A E O C G O
8 G O O E F A A

The optimized work-study student shift table.

Student Mon. Tue. Wed. Thu. Fri. Sat. Sun.
1 G A E E G (O) (O)
2 E G C G C (O) (O)
3 A G E A (G) (O) O
4 G F E E (G) (O) O
5 F G E (G) (F) O O
6 G E O (O) (A) A G
7 G O (G) (O) G G A
8 O O (G) (G) F B B

The fatigue states using the original work-study student shift table.

The fatigue states using the optimized work-study student shift table.

4. Conclusions

In this paper, we proposed a modified fatigue model, which is shown to be much accurate than the model used in the previous work. We also demonstrated how to incorporate the proposed fatigue model with an optimal scheduling problem. The proposed formulation also allows employees to choose the weightings of their preferred days off schedules so that the solver can select the most appropriate days off arrangement to the employees’ likings. Other constraints, such as manpower requirements and government/company regulations, are also considered in our formulation so that the scheduling problem being considered is closer to the applications in the real world.

There are some issues not being considered in the proposed fatigue model. We did not consider the case in which the employee may work in different time zones. The circadian rhythm change effect is also not present in the current formulation. How to combine these effects in the fatigue model while making it possible to be integrated in the optimization problem formulation will be pursued in the future.

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

Acknowledgment

This work was supported by the National Science Council of Taiwan under Grant NSC-99-2221-E-006-057.