Algorithms and Complexity Group
  • People
  • Research
  • Courses
  • Talks
  • Jobs
  • Contact

Cooperative Personnel Scheduling (Research Project)

a joined research project from the Algorithms and Complexity Group, TU Wien, Austria, and Honda Research Institute, Germany

Project Team

Johannes Varga

Günther Raidl

Tobias Rodemann

Topic

In classical personnel scheduling, the employees of a company are assigned their schedules, which determine at which times they work to fulfill some kind of demand. Our setting is slightly different. Each employee also referred to as a user, has some jobs to complete that need a specific resource. Only a limited amount of resources is available and only one job can use a resource at a time. Each job has to be assigned to a resource and a timespan in which the job is carried out. Furthermore, users will have preferences on when their jobs should be executed. These preferences have to be collected in some way. One possibility would be to let the employees specify their full preferences in the beginning. But this is tedious for the employees, error-prone and only allows for preferences that were explicitly considered when designing the algorithm.

In this project, we will develop and investigate a framework that learns these preferences over time through a limited amount of user interactions. The framework aims to construct schedules that respect employees' preferences and are feasible with the given restrictions. While constructing the schedules it is allowed to ask the employees a limited number of questions regarding their preferences. The responses to these questions are used to model the employees' preferences. The framework may also consider fairness, e.g. by balancing the number of user interactions among the employees. Research questions to answer include which algorithms work well for the occurring problems, how to model the employees' preferences, and which kind of user interaction gives sufficient information on the preferences, without overwhelming the employees.

News

  • Best Paper Award at SOFSEM 2025

    Best Paper Award at SOFSEM 2025

    2025-01-23
    Thomas Depian, Simon D. Fink, Alexander Firbas, Robert Ganian, and Martin Nöllenburg received the Best Paper Award for their paper …Read More »
  • Markus Wallinger receives Award of Excellence for his PhD Thesis

    Markus Wallinger receives Award of Excellence for his PhD Thesis

    2024-12-05
    Our former group member Markus Wallinger won the Award of Excellence by the Federal Ministry for Education, Science and Research. …Read More »
  • Thomas Depian receives State Prize for his Master’s Thesis

    Thomas Depian receives State Prize for his Master’s Thesis

    2024-11-21
    Our group member Thomas Depian won the Appreciation Award given by the Federal Ministry for Education, Science and Research. This …Read More »
  • Best Paper Award at GECCO 2024 for M. Bresich, G. Raidl, and S. Limmer

    Best Paper Award at GECCO 2024 for M. Bresich, G. Raidl, and S. Limmer

    2024-07-24
    Maria Bresich, Günther Raidl, and Steffen Limmer received the best paper award at the 2024 Genetic and Evolutionary Computation Conference …Read More »
  • Welcome to our Feodor Lynen Fellow Dr. Frank Sommer

    Welcome to our Feodor Lynen Fellow Dr. Frank Sommer

    2024-06-14
    On June 1, 2024, Dr. Frank Sommer has joined the Algorithms and Complexity group with a prestigious Feodor Lynen postdoc …Read More »

News archive

All news for 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022, 2023 and 2024.
TU Wien Informatics
Offenlegung (§25 MedienG) Inhaber der Website ist das Institut für Logic and Computation an der Technischen Universität Wien, 1040 Wien. Die TU Wien distanziert sich von den Inhalten aller extern gelinkten Seiten und übernimmt diesbezüglich keine Haftung. – Disclaimer – Datenschutzerklärung
Log in requires cookies.