{'fraction_non_alphanumeric': 0.03558544515209549, 'fraction_numerical': 0.01674609183628023, 'mean_word_length': 4.796076406814662, 'pattern_counts': {'":': 0, '<': 2, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Integrated Employee Scheduling with Known Employee Demand, Including Breaks, Overtime, and Employee Preferences

Purpose: This research paper introduces an integrated employee scheduling problem that considers various real-life problems such as varying employee demand, different employee working conditions, and individual preferences, regarding schedules. Design/methodology/approach: The proposed model, which is a combination of Analytic Hierarchy Process and Mixed Integer Linear Programming, is used to solve the problem with multi-dimensional objectives period. Findings: Results show that the proposed model generates optimal and feasible solutions for weekly employee schedules. Originality/value: Many employee scheduling problems in literature are able to solve the employee scheduling problem to a large extent. However, these studies still do not fully reflect current realistic organizational problems such as varying employee demand per hour interval, different employee working conditions on disjoint shifts and breaks, and individual preferences regarding schedules all at the same time.


Introduction
As one of the most common and difficult organizational problems, the Employee Scheduling Problem (ESP) has been widely studied since it was first formulated by Dantzig (1954) using Integer Linear Programming (ILP). Employee or personnel scheduling, as defined by Ernst, Jiang, Krishnamoorthy and Sier (2004), is the process of constructing work timetables for the staff, assigning qualified workers to meet employee demand for the task, and satisfying employees' working condition and individual preferences. As the number of employees and company size increases, the complexity and challenge to schedule all employees while meeting certain rules, regulations, and worker preferences also increase. In a review of over 300 related literature on employee scheduling by Van den Bergh, Beliën, De Bruecker, Demeulemeester and De Boeck (2013), the authors have noted that most literature in the ESP domain often oversimplify real-life conditions. This results to considerable inaccuracy in the model. Van den Bergh et al. (2013) thus proposed to simultaneously integrate as many aspects as possible (especially controllable variables) to the model. The same paper also enumerated several components of an ESP, as proposed to be integrated into the model. The authors find that the most basic components that appear in real life situations are (i) having employee demand, (ii) a flexible break placement, (iii) employees performing overtime work, and (iv) considering employee preferences such as rest day and vacation leave. An ESP having all of these components will be called Integrated Employee Scheduling Problem (IESP) from hereon. According to Kletzander, Mischek, Musliu, Post and Winter (2017), the General ESP consists of (i) tasks that need to be done where employee demand arises, (ii) shifts which consist of a group of tasks, and (iii) a set of employees who are assigned to the shifts.
The first component is employee demand, defined by Ernst et al. (2004) as the number of employees needed at different time periods. In a case study done by Kabak, Ülengin, Aktaş, Önsel and Topcu (2008), employee demand for the whole week from 10:00 AM to 21:00 PM varies throughout the day. Furthermore, demand is higher during some days of the week (e.g. weekends). Assuming that there are a constant number of employees available throughout the day, an over-coverage (or under-coverage or shortage) occurs when there are more (or less) employees than demand. Both should be avoided since these leads to additional labor costs and lower service quality, respectively. The second is shift, consisting of shift type, that depends on the organization. In establishments that do not operate 24 hours in a day (e.g. malls), there are usually only two (2) shift types -opening and closing; while in those that do (e.g. call centers), there are usually multiple shifts -morning, evening, and night. Shifts usually have a length of 9 hours for full-time employees (8 working hours and a 1-hour meal break). Due to the varying employee demands, management often allows flexible breaks placements that are within a time window.
The third component is the set of employees who are heterogeneous in nature, having their own appointment paper or contract. In these documents, the general tasks of the employees are detailed -their working shift, benefits, and working conditions such as hours of work and rest day (RD). Leave benefits like sick leave (SL), vacation leave (VL), and other leaves are very common in many organizations. Some are mandated by the government, but only the Vacation Leave (VL) is planned by the employee and controllable by the management. Both hours of work and Rest Day (RD), as well as VL, affect employee satisfaction. According to Yee, Yeung and Cheng (2008), it is vital to ensure that employees are satisfied since happy and satisfied employees lead to high service quality and customer satisfaction, which eventually leads to higher profits.
Many past papers concluded that the ESP is typically highly constrained, and it would be difficult to satisfy all restrictions. That is why many opt to categorize the constraints into hard and soft constraints. Hard constraints are the ones that need to be satisfied for a solution to be feasible while soft constraints allow violations that penalize the objective function. Minimizing penalty functions (e.g. unsatisfied preferences of employees) are widely used in the hospital setting since there is usually a high turnover ratio for nurses. Topaloglu (2006) and Huang, Hsieh and Hsia (2016) are some examples of nurse rostering problems that minimized penalty functions. Although this is normal in the hospital setting, it is not yet used in an IESP which considers not just employee preferences, but also overtime, over-and under-coverage from employee demand, and working conditions. Given this premise, there is a need to solve the Integrated Employee Scheduling Problem (IESP) that reflects current real-world settings which would minimize the total penalty functions of over/under-coverage from employee demand, overtime, and unsatisfied employee preferences simultaneously.
The rest of the paper is organized as follows: section 2 indicates the related literature, gap analysis and solution methodology to be used, section 3 describes the problem and formulation of the proposed model, section 4 shows the validation of the model, and section 5 reveals the sensitivity analysis on the preferences. The last section draws the conclusion and suggested further research.

Review of Related Literature
There are many factors that can be highlighted in the Employee Scheduling Problem. For this research paper, most of the literature reviewed considered employee demand in their model. Indeed, employee demand is the most basic and commonly included component in an ESP. Varying employee demands throughout the day, as well as, constraints such as employees working for consecutive hours in a day expectedly result to over-and under-coverage at different times within the day. However, these can be minimized as in Jones and Nolde (2013) and Dahmen and Rekik (2015). For Dahmen and Rekik (2015), ensuring personnel demand is met was more important than having more staff than needed so the authors put a higher cost on under-coverage while also allowing flexible break placement. Soukour, Devendeville, Lucet and Moukrim (2013), Kuo, Leung and Yano (2014), and Ingels and Maenhout (2017), on the other hand, only took account under-coverage in their models. This is similar with Bürgy, Michon-Lacaze and Desaulniers (2019) that penalizes under-coverage in the problem of employee scheduling that is particularly characterized by demand that has perturbations. While none of the related literature considered to minimize over-coverage only in their objective function, the rest have made it a hard constraint to meet the exact employee demand so that the result will have neither over-or under-coverage of the demand.
Some research papers that deal with solving personnel scheduling look for a schedule that minimizes total labor cost, such as in Bard and Binici (2003) and Alfares (2007). Though sometimes overtime is unavoidable, only Soukour et al. (2013) tried to minimize overtime cost along with undertime, under-coverage, and employee dissatisfaction costs. Valcour (2007) concluded that overworking employees will give them less work-life balance which will likely lead to low satisfaction and high employee turnover rate. Out of the closest related literature, Jones and Nolde (2013) and Bard and Binici (2003) considered an upper bound on the number of days per week an employee should work. Accordingly, in some service-oriented organizations, entry-level employees are given one (1) or two (2) RDs per week and the employees are allowed to select their preferred RD. Though it is important to give employees some level of job control and increase satisfaction (Wong & Ko, 2009), it is often neglected in many literatures. Non-consideration of RD preferences results to unfulfilled RDs, particularly when more employees are needed on some days. In addition to RDs, there are also vacation leaves (VLs) per year that employees may request for. It is important to grant requests for a vacation to increase employee satisfaction and quality of life (Gilbert & Abdullah, 2004). Employees typically request for time-off one (1) to two (2) weeks prior to their desired VL. Although VL is a benefit that most employees have, request for vacation is hardly included in personnel scheduling. From the managerial perspective, it would be useful to have these included in the optimization model to account for employees unavailable for assignment on certain days.
Only in a few studies is the RD preference given importance. These few studies include Huang et al. (2016) that incorporate nurses' preferences on their RDs. Another study is that of Ang, Razali, Asyikin and Kek (2019) that proposes an optimized schedule for security staff that maximizes the satisfaction of the security staff by allowing them to choose their preferred shift and RD, while taking into consideration the organization's (in this study's case, the organization is a university) rules. However, this study has the sole objective of maximizing employee satisfaction. Over/under-coverage is not explicitly stated in the objective. The objective of maximizing employee satisfaction has also been addressed by some studies, such as Tanazaki, Shimmura, T., & Fujii (2017) that tackles employee satisfaction by balancing it with customer satisfaction and management satisfaction. In brief, this study's approach to solving the problem of employee scheduling is to assign low-value work to robots and high-value work to employees. This approach is not the same as the approach of this study.
Other characteristics that this study will not consider are scheduling for multiple tasks and multi-skilled employees across different locations as done by Kuo et al. (2014), or same location, multi-rank & multi-skilled worker as studied by Shuib and Kamarudin (2019). This study will also not consider approaches such as job rotation as contributed by Rerkjirattikal and Olapiriyakul (2019) that looks at job satisfaction related to overtime assignments in a harsh industrial environment, not considering preferred RD. Similar to this study on job satisfaction related to overtime, by Yang, Tang and Zhao (2017) that aimed to investigate the employees' job satisfaction on overtime given uncertain demand and operations costs. Furthermore, this study will not consider multiple opportunities for prescheduling overtime prior to the start of the shift as done by Campbell (2017). Thus, with the aforementioned, the contribution of this research is to bring to the forefront the importance of employee satisfaction, particularly about their preferred RD, which has not been given much attention hitherto, in the same level as previously focused on objectives of minimizing under/over-coverage and overtime.
The IESP is a new variation in the ESP domain that has not yet been solved. For practicality, the MILP can be a starting model that may be extended to more complex IESPs. The proposed solution methodology begins by using AHP to obtain the weights and then plugging those as the objective function coefficients to the MILP model to solve the problem.

Problem Description and Model Formulation
In this section, the problem description, notations, and mathematical formulation is introduced. The model incorporates the weekly schedules of all employees, their break time, work conditions, and preferences that satisfies all hard and soft constraints at a predefined set.

Formulation
The IESP will be solved by minimizing the total of objective functions subject to the following constraints (C#1 to C#15). The first and second terms in the objective function are the over-and under-coverage from the employee demand multiplied to their corresponding penalty weights. The third term is the total overtime work performed multiplied to the overtime penalty weight. While the fourth and fifth terms are the total unsatisfied (or not granted) preferences in rest day (RD) and vacation leave (VL) requests multiplied to their corresponding penalty weights. (1)

Subject to:
(C#1) Total assigned workdays per week should be at least the minimum number of contracted workdays.
(2) (C#2) Total assigned workdays per week should not exceed the maximum number of contracted workdays.
(3) (C#3) Employees who did not request for vacation leave (VL) should work exactly the maximum number of contracted workdays per week.
(4) (C#4) 1-hour meal break should be assigned to employees within a time window [eb j , lb j ] for employee e assigned to work on day d at shift j (x edj = 1).
(C#5) If employee e is assigned to work on day d at shift j (x edj = 1), he is also assigned to perform work within his shift t  [st j , eet j ] with a 1-hour break during his regular working hours.
(C#6) The total overtime of employee e at day d who is assigned to shift j is called π edj .
(C#7) Total overtime π edj per day d at shift j per employee e should not exceed allowable overtime (OT) per day if he is assigned to work on day d (x edj = 1).
(C#8) If an employee is assigned to work during overtime (OT) hours (t  [eet j +1, let j ]), he should also be assigned to the preceding time period within the OT hours to ensure continuous assignment of work during overtime.
(C#9) Total available employees which is the total employees working less employees who are on break (∑ eE ∑ jJe y edjt -br edjt ) should meet employee demand at day d at each time period t, allowing for over-coverage (α dt ) and under-coverage (b dt ).
(10) (C#10) Employee e at days d should not be assigned to shifts j and time periods t outside of his regular working hours and overtime period.
(C#11) Employee e at days d should not be assigned to days d and time periods t outside his assigned shift j.
(C#12) Employee e at days d should not be assigned to a break outside of his break window time periods t for his assigned shift j.
(C#13) Employee e at days d should not be assigned to a break outside his assigned shift j for all time periods t.

Validation of the Model
To validate the proposed model and solution method, published data from Alfares (2007) is used. The solution of Alfares (2007) showed a set of employees and their tour assignments that consist of shift types with defined start and end time, break time, and pre-specified rest days. For simplicity, instead of using, time periods will be used hours (e.g. time period 1 = 00:00AM to 01:00 AM, time period 2 = 01:00AM to 02:00 AM, etc.). The problem summary, as well as changes and additional assumptions, are listed in Table 5, while the actual data on demand was retained as is in Alfares (2007). The readers are referred to Alfares (2007) for a reference. A visual representation of the new shifts is depicted on Figure 1. Black means the regular nine (9) working time periods (e.g. time period 7 to 15 for shift 1), yellow is the break window, and gray is the possible overtime work period (e.g. time period 16 to 19 for shift 1).

Description Alfares (2007) Proposed Model
Employee demand Known, hourly (24 hours), one (1)  Rest days of the shift employees are varying and not given in Alfares (2007) so the rest days in the proposed model will assume random consecutive days since according to Nanda and Browne (1992), nonconsecutive days off are less desirable for employees. Vacation leave is also not included in the data set. It will be randomized using a discrete uniform distribution between 0 and 1 (50% probability for each). A value of 0 means the employee did not request for a vacation leave, while a value of 1 means the employee requested for a vacation within the planning horizon. If an employee requests for vacation, it is assumed to be adjacent to the rest day for a total of three (3) consecutive off days (Nanda and Browne, 1992). Lastly, the maximum overtime is assumed to be 50% of the working hours per shift which is four (4) hours for all employees, while the minimum and maximum working days per week for all employees are four (4) and five (5) days because there are two (2) rest days (maximum of 5 working days) and one (1) allowable vacation leave request (minimum of 4 working days). The total number of employees is 44 and there are two (2) days of rest day (RD) request for each employee for a total of 88 rest day requests. After generating randomly who among the employees will request for vacation leave (VL), a total of 18 VL requests came up. In addition, the probability distribution and assumptions on RDs for the shift employees and VL request for all employees are summarized in Table 6.
At this point, it is important to note that in this IESP, the weights calculated are based on the preferences of the shift manager/supervisor on how they would manage their staff's schedule. As seen above, most of the validation, particularly for the job satisfaction in terms of meeting the preferred rest days, was done by simulation. In order to augment this, this study interviewed one real respondent and collected the respondent's set of preferences when scheduling staff. The respondent works at a Restaurant as a Shift Manager who delegates tasks to staff and manage their shifts (see below for a detailed professional profile). In a different industry or organization, the personnel who manages the staff schedules may have a different set of preferences that is consistent (Consistency Ratio < 0.10) which would result to a different optimal solution.
2) Planning for each shift and monitoring performance during the shift.
3) Maintaining a fully stocked inventory and ordering food supplies, as needed. 4) Entering and checking of daily time records and sending to employee cooperative/agency. 5) Managing dining reservations. 6) Administrative duties. In getting the AHP matrix, the Shift Manager was interviewed and asked to fill the pairwise comparison matrix in Table 7 on the consideration of every objective in scheduling employees. The AHP matrix is then normalized as shows in tale 10. Finally, the weights of the objectives, as well as the rankings summarized in Table 9 were calculated using MS Excel and then exported to LINGO to solve the IESP.

Sensitivity Analysis
To evaluate the robustness of the results, a sensitivity analysis of the preferences was made due to its innate variability. To do this, let every comparison in the AHP matrix vary randomly by ±1 as suggested by Emblemsvåg and Tonning (2003). That is, if a score of 5 is given between a comparison, the score of the same comparison can vary between 4 and 6. A simulation was run with 200 data points and five (5) replications which showed an average deviation of 3.27% from the original weights. Including all replications and data points, results in Table 11 show that over-coverage (rank 5) is always at the same rank. Under-coverage consistently had the highest weight (rank 1), 99.3% of the time; overtime (rank 4) stayed the same 99.9% of the 200 data points and five (5) replications; while unsatisfied rest days (rank 2) and vacation leave (rank 3) had the 2 nd and 3 rd highest weights 96.4% and 96.7% of the time among the objectives, respectively.
Several instances wherein the rankings were changed (e.g. the % same rank is < 100% as described in Table 12) were check for any changes in the objective value and whether a feasible solution will still be found. Results show that the penalty weights of an instance of each of the five (5) cases were plugged into the objective function. After running the model using the simulated penalty weights, a global optimum solution was found for all cases (Table 13).It is clear that even if the preferences vary randomly by ±1 and rankings changed in some instances, there is only minimal change in the solutions generated. Therefore, it can be said that the preferences are robust. Under-C (rank1) and RD (rank 2) switched 11 2 Under-C (rank 1) and RD (rank 2) tied at rank 1 4 3 RD (rank 2) and VL (rank 3) switched 23 4 RC (rank 2) and VL (rank 3) tied at rank 2 3 5 VL (rank 3) and OT (rank 4) switched 1 Total 42

Conclusion and Further Study
In this research paper, a new integrated employee scheduling problem (IESP) was introduced which reflects current real-world settings. The IESP has basic components that appear in real-life situations such as varying demand, possibility to render overtime, flexible break placement, and employee preference consideration. To solve the IESP, an AHP + MILP model was proposed and tested using published data from Alfares (2007) and produced a global optimum solution. While preferences are subjective and are variable in nature, sensitivity analysis is used to evaluate the robustness of the preferences by allowing the comparisons to vary randomly by ±1. The analysis shows that at least 96.2% of the time for 200 runs and five (5) replications, the ranking of the objectives stays the same.
The integrated employee scheduling problem (IESP) introduced in this paper is a new problem relevant to current industry standards. Thus, the proposed model in this research paper can be a base model, to which future researchers can add other components.