Scheduling, planning and timetabling
In general, scheduling and timetabling solve the problem of assigning jobs or tasks on the available resources in time. Moreover the overall profit of such assignment should be maximized, when these tasks or jobs are performed according to the prepared schedule or the timetable. Finding of suitable schedule is necessary in various real-life problems such as the nurse rostering, the university course timetabling or the job scheduling.
The main research goals of this group includes
- scheduling in the Grid environment
- data transfer planning
- dynamic scheduling
- university timetabling
The goal of Grid scheduling is to assign jobs of several users onto the suitable and available machines in large, heterogeneous and dynamic computing environment. Such process should satisfy several criteria such as the good machine utilization, the fairness or the non-trivial Quality of Service (QoS).
Grid scheduling problem is closely related to the dynamic scheduling problem. While in the classical scheduling the whole problem is known in advance, in the dynamic case the problem changes over time as the solution is created. Jobs, tasks, etc., as well as resources may appear and disappear (job arrivals, job completions or cancellations, machine failures and restarts) or the parameters of jobs or tasks may change. Typically, the execution time of a job may change. Therefore, in the dynamic scheduling problem an efficient construction of the schedule with appropriate reactions on dynamic changes is requested.
University course timetabling solves the problem of finding suitable timetable for courses taught at the university. Courses are assigned into time slots and available classrooms so that the students' requirements, preferences of teachers as well as the study requirements are all met. A long-term research in this area together with the collaboration with the Purdue University lead to the development of a unique timetabling system, that is able to solve many timetabling problems of a very large scale.
Information for students
The area of timetabling and scheduling provides several interesting topics, which can include both practical and theoretical research. You can join this group either through writing bachelor or master thesis or through the doctoral study. IS MUNI provides several available topics for the bachelor or master thesis. These topics are offered and supervised by the members of this research team. Moreover, based on the mutual agreement with the student, it is also possible to create a new topic in the area of our research.
Current topics of doctoral students:
- Event-based grid scheduling
- Data transfer planning
Current topics of master and bachelor thesis:
- Grid scheduling with local search
- Scheduling with uncertain processing time
- Grid scheduling for jobs with preemptions
- Implementation of solver for media streams planning problem
- Implementation of open-source solver for media streams planning problem
- Dynamic data transfer planning with local search
- Library of algoritms to solve dynamic problems
- Course timetabling at Masaryk University
- Course timetabling with constraint programming
- Nurse rostering with constraint programming
- Data transfer planning
- Dynamic scheduling of jobs to computational resources
- Course timetabling with integer programming
- Project scheduling
- Nurse rostering
- Job scheduling with the SLURM resource manager
- Visualization of schedule creation and optimisation
- Local search for scheduling problems
- Scheduling in Parallel and Distributed Environment
- Scheduling with constraint logic programming
- Soft constraints for scheduling
- Algorithms for Constraint Satisfaction Problems
International and national collaboration
This group closely cooperates with several international institutions, including
- Space Management and Academic Scheduling department, Purdue University, USA
- Automated Scheduling, Optimisation and Planning research group, University of Nottingham, UK
- High Performance Computing Lab, Istituto di Scienza e Tecnologie dell'Informazione A. Faedo, Consiglio Nazionale delle Ricerche, Italy
On the national level, we cooperate with several teams involved in the joint research projects. Those are especially
- Institute of Computer Science, Masaryk University
- Department of Theoretical Computer Science and Mathematical Logic, Faculty of Mathematics and Physics, Charles University in Prague
Current grant projects
- GA ČR 202/12/0306 : Dyschnet - Dynamic planning and scheduling of computational and network resources, 2012-2015,
- Highly Parallel and Distributed Computing Systems, 2005 - 2011, research intent 0021622419, Ministry of Education, Youth and Sports CR
- GA ČR 201/07/0205 : Dynamic aspects of Scheduling, 2007 - 2009, joint project lead by the group of Roman Barták z MFF UK
- CoreGRID project (European Research Network on Foundations, Software Infrastructures and Applications for large scale distributed, GRID and Peer-to-Peer Technologies), Institute on Resource Management and Scheduling, 2005 - 2008
Research team from the Masaryk University
Group leader:
Hana Rudová
Employees:
Luděk Matyska,
Miroslav Ruda
PhD students:
Pavel Troubil,
Dalibor Klusáček
Bachelor and Master students:
Matúš Goljer,
Václav Chlumský,
Pavel Januš,
Matej Lukáč,
Jiří Marek,
Jiří Rousek,
Peter Sarvaš,
Tomáš Svoboda,
Andrea Vašeková,
Miroslav Žůrek
Contact
doc. Mgr. Hana Rudová, PhD.
hanka@fi.muni.cz
http://www.fi.muni.cz/~hanka
fi
muni