OPTIHPER: A Computer-Based Decision Support System for Employee Timetabling Problemsby Antonio Lova, Pilar Tormos and Federico Barber A high degree of job satisfaction is an essential factor in the success of a company. A company’s objectives, labour conditions and worker preferences must be optimized in a complex space of solutions. OPTIHPER (Optimización de Horarios de Personal - Employee Timetabling Optimization) is a computer-aided system able to efficiently assign employees to tasks while verifying a wide set of constraints and optimizing organizational objectives and employee preferences. The system is currently in use by leading commercial companies with very good results Employee Timetabling Problems (ETPs) arise in any organization with a set of tasks that must be assigned to a set of employees, each with their own qualifications, constraints and preferences. This problem arises in many institutions (hospitals, supermarkets etc) where the assignment of employees is usually performed manually. However, in companies with a large number of workers and working centres, the use of computer-based tools is essential for making organizational objectives compatible with worker preferences. ETPs can be formulated as a constraint network, where the main entities that define the problem are tasks, workers and timetables. Tasks can be sporadic or can be repeated along one shift. They can have either a fixed duration or require a certain amount of work (man-hours) to complete. Workers may have different degrees of qualification for each task and can be assigned to different timetables. Timetables are defined by the start/finish time and the shift (usually morning, afternoon, evening and night). Once assigned, shifts are maintained during a period of time and follow rotation patterns. A number of constraints arise in ETPs. Hard constraints must be satisfied for a solution to be feasible. For instance, task constraints require that each task be assigned only to the most skilled available workers. Worker constraints may require that the timetable assigned to each worker belongs to its feasible set of timetables (working hours according to their contract) and is kept for a given period of time. Meal breaks must be assigned to workers within the limits allowed by company requirements, but while guaranteeing task requirements. Soft constraints should be met as far as possible, but without affecting the quality of the final solution. Some examples are:
A solution of the problem is an assignment that fulfils the set of hard and soft constraints and optimizes an objective function. This is an NP-hard problem that requires the use of efficient heuristics. OPTIHPER: A Software System to Solve Employee Timetabling Problems Solving Process: A Multi-Start Randomized Algorithm
Architecture of OPTIHPER ![]() Figure 1: Flow Chart of OPTIHPER. Conclusions ![]() Figure 2: Input data and solver status windows. ![]() Figure 3: Partial view of task assignment (solution). Link: Please contact: |











