Tölvunarfræðideild

Viðburðir

ICE-TCS seminar Eyjólfur Ingi Ásgeirsson

  • 10.2.2012, 14:00 - 15:00

Eyjolfur-Ingi-AsgeirssonWho: Eyjólfur Ingi Ásgeirsson

Where: V-109

When: 2pm, Friday, February 10th, 2012 

What: Local-search vs. near optimal MIP solutions for preference based staff scheduling.

How: Every company that has employees working on irregular schedules must deal with the difficult and time consuming problem of creating feasible schedules for the employees. We introduce and compare a local-search based algorithm and a near optimal mixed-integer programming solution that take a partial schedule created by requests from employees and create feasible schedules where most of the employee's requests are unchanged, while still making sure that rules and regulations are not violated.  The local search algorithm is based on independent modules, which can be executed in any order, and each module tries to emulate some action taken by a staff manager.  We will present the algorithm and the MIP model and show results from four real world companies and institutions.