An Optimization Software to solve Employee Timetabling Problems: OPTIHPER

نویسندگان

  • Pilar Tormos
  • Antonio Lova
  • Federico Barber
چکیده

Employee Timetabling is the operation of assigning employees to tasks in a set of shifts during a period of time. There is a wide set of constraints to meet concerning shift rotation, workers demand, qualification degree, etc. and a multi-objective function to be optimized. The main objective is to determine the best assignment that verifies the constraints and maximizes the tasks assigned simultaneously considering a wide set of workers’ and organizational preferences. OPTIHPER is a software system which, integrating advanced heuristic AI/OR techniques, is able to obtain optimized solutions to real-world problems with a wide set of very complex constraints and a multicriteria objective function. A customized version of this system is used with very satisfactory results by a Spanish leading distribution company involving a staff of over 55,000 workers distributed in more than 1,000 centres.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

OPTIHPER: A Computer-Based Decision Support System for Employee Timetabling Problems

High degree of job satisfaction is an essential factor for the success of a company. Company’s objectives, labour conditions and workers' preferences have to be optimized in a complex space of solutions. OPTIHPER is a computer-aided system able to efficiently assign employees to tasks verifying a wide set of constraints and optimizing organizational objectives and employee’s preferences. The sy...

متن کامل

Solving the Employee Timetabling Problem Using Advanced SAT & ILP Techniques

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 while meeting the employee’s preferences and organizational work regulations. The problem also attempts to optimize the performance criteria and distribute the shifts equally among the employees. The problem is known to be a complex optimization problem...

متن کامل

Solving Employee Timetabling Problems by Generalized Local Search

Employee timetabling is the operation of assigning employees to tasks in a set of shifts during a xed period of time. We present a general deenition of employee timetabling problems (ETPs) that captures many real world problem formulations and includes complex constraints. We investigate the use of several local search techniques for solving ETPs. In particular , we propose a generalization of ...

متن کامل

Iterative restart technique for solving timetabling problems

Restart techniques for randomizing complete search algorithms were proposed recently by Gomes et al., for solving hard combinatorial problems. A new iterative algorithm that uses restart techniques is proposed, and its behavior analyzed on random timetabling problems. Employee timetabling problems (ETPs) can naturally represented by constraints networks for real world instances which are large ...

متن کامل

Cut generation for an integrated employee timetabling and production scheduling problem

This paper investigates the integration of the employee timetabling and production scheduling problems. At the first level, we manage a classical employee timetabling problem. At the second level, we aim at supplying a feasible production schedule for a set of interruptible tasks with qualification requirements and time-windows. Instead of hierarchically solving these two problems as in the cur...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007