Engineering, CTU Prague, Czech Republic.
Expected to start in September 2011
Topic: Personnel Rostering with on-line varying workforce demand function
Co-supervisors: Zdenek Hanzalek and Premysl Sucha
The goal of the personnel scheduling problem is to assign a set of the
required shifts to a set of employees while respecting given constraints.
The objective is to maximize the employee satisfaction and to minimize labor
costs. Even the problems with few constraints and very simple objective
function are NP-hard. However, with the use of combinatorial optimization
algorithms we are able to solve very complex problems to replace
time-consuming manual design of the schedule.
We deal with a problem motivated by the transport services (e.g. airport
companies), where the set of shifts can be quite large. This is caused by
the demand function, determining the minimal number of employees required
each hour. The function reflects the fluctuation of the workforce demand
during the day, caused by the traffic peaks and differs per day of the week
and per seasons of the year. Moreover, in some cases, the workforce demand
is on-line varying depending e.g. on whether or on the volume of required
services. The goal of the thesis is to find appropriate methods for shift
planning and personnel scheduling in this area, to develop efficient
algorithms, to evaluate them on benchmarks and to publish original results
in peer-reviewed conferences and journals.
The candidate should have a master degree in computer science or related
field, good mathematical skills, background in optimization algorithms and
experience in programming.
A cover letter and CV should be sent to hanzalek@fel.cvut.cz before 30th May
2011.
--
Zdenek Hanzalek
Department of Control Engineering, Faculty of Electrical Engineering,
Czech Technical University in Prague, Karlovo namesti 13, 121 35 Prague 2,
Czech Republic
tel: +420 224355708 hanzalek@fel.cvut.cz
fax: +420 224355703 http://dce.fel.cvut.cz/hanzalek
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
