Solving Employee Timetabling Problems by Generalized Local Search Content Areas Scheduling,.pdfVIP

Solving Employee Timetabling Problems by Generalized Lo cal Search Content Areas Scheduling Search Applications Tracking numb er A Abstract signs employees to tasks in shifts where shifts can reside anywhere on the time axis Meisels et al It is a Employee timetabling is the op eration of as common view that one ma jor dierence b etween ETPs signing employees to tasks in a set of shifts dur and generic timetabling problems cf Burke and Carter ing a xed p erio d of time We present a general is the presence of sp ecic complex constraints denition of employee timetabling problems due to lab our regulations see eg Kragelund ETPs that captures many real world prob Meisels et al lem formulations and includes complex con straints We investigate the use of several lo cal The present work includes the design and the imple search techniques for solving ETPs In particu mentation of a general software framework in C for lar we prop ose a generalization of lo cal search testing many search strategies and the design of a stan that makes use of a novel search space that in