Summary: Abstract -- The Employee Timetabling Problem (ETP) is
concerned with assigning a number of employees into a given
set of shifts over a fixed period of time, e.g. a week, while meet-
ing the employee's preferences and organizational work regu-
lations. The problem also attempts to optimize the
performance criteria and distribute the shifts equally among
the employees. The problem is considered a classical NP-com-
plete optimization problem. It has received intensive research
during the past few years given its use in industries and orga-
nizations. Several formulations and algorithms based on local
search have been proposed to solve ETPs [12, 15, 17, 18]. In
this paper, we propose a complete approach using integer lin-
ear programming (ILP) to solve these problems. The ILP
model of interest is developed and solved using the generic ILP
solver CPLEX and the Boolean Satisfiability ILP solver PBS.
Experimental results indicate that the proposed model is trac-
table for reasonable-sized ETP problems.
Index Terms -- Employee Timetabling, Optimization,
Scheduling, ILP, Boolean Satisfiability.