Skip to main content

previous disabled Page of 2
and
  1. Article

    Open Access

    Real-world university course timetabling at the International Timetabling Competition 2019

    The paper discusses the organization of the International Timetabling Competition (ITC 2019), which intends to motivate further research on complex university course timetabling problems coming from practice. ...

    Tomáš Müller, Hana Rudová, Zuzana Müllerová in Journal of Scheduling (2024)

  2. No Access

    Chapter and Conference Paper

    Real-World Vehicle Routing Using Adaptive Large Neighborhood Search

    Our work addresses a real-world freight transportation problem with a broad set of characteristics. We build upon the classical work of Ropke and Pisinger [10] and propose an effective realization of the adaptive...

    Vojtěch Sassmann, Hana Rudová in Evolutionary Computation in Combinatorial … (2023)

  3. No Access

    Article

    Scheduling of mobile robots for transportation and manufacturing tasks

    Current manufacturing systems have a tendency to become more and more flexible to adapt to the needs of product diversification. Such a system, e.g. flexible manufacturing system, consists of a number of autom...

    Quang-Vinh Dang, Cong Thanh Nguyen, Hana Rudová in Journal of Heuristics (2019)

  4. No Access

    Chapter and Conference Paper

    Scheduling of Mobile Robots Using Constraint Programming

    Mobile robots in flexible manufacturing systems can transport compo...

    Stanislav Murín, Hana Rudová in Principles and Practice of Constraint Programming (2019)

  5. No Access

    Article

    Planning of distributed data production for High Energy and Nuclear Physics

    Modern experiments in High Energy and Nuclear Physics heavily rely on distributed computations using multiple computational facilities across the world. One of the essential types of the computations is a dist...

    Dzmitry Makatun, Jérôme Lauret, Hana Rudová in Cluster Computing (2018)

  6. No Access

    Article

    Dynamic reconfiguration in multigroup multicast routing under uncertainty

    Motivated by high quality multimedia and remote collaborative environments, we solve the problem of multigroup multicast routing with a number of features important for real-world deployment of the interactive...

    Pavel Troubil, Hana Rudová, Petr Holub in Journal of Heuristics (2018)

  7. No Access

    Article

    Real-life curriculum-based timetabling with elective courses and course sections

    This paper presents an innovative approach to curriculum-based timetabling. To capture complex relations of real life curriculum-based timetabling problems, curricula are defined by a rich model that includes ...

    Tomáš Müller, Hana Rudová in Annals of Operations Research (2016)

  8. No Access

    Chapter and Conference Paper

    Multi-resource Aware Fairsharing for Heterogeneous Systems

    Current production resource management and scheduling systems often use some mechanism to guarantee fair sharing of computational resources among different users of the system. For example, the user who so far...

    Dalibor Klusáček, Hana Rudová in Job Scheduling Strategies for Parallel Processing (2015)

  9. No Access

    Chapter

    A Metaheuristic for Optimizing the Performance and the Fairness in Job Scheduling Systems

    Many studies in the past two decades focused on the problem of efficient resource management and job scheduling in large computational systems such as HPC clusters and Grids. For this purpose, the application ...

    Dalibor Klusáček, Hana Rudová in Artificial Intelligence Applications in In… (2015)

  10. No Access

    Chapter and Conference Paper

    Multi Resource Fairness: Problems and Challenges

    Current production resource management and scheduling systems often use some mechanism to guarantee fair sharing of computational resources among different users of the system. For example, the user who so far...

    Dalibor Klusáček, Hana Rudová, Michal Jaroš in Job Scheduling Strategies for Parallel Pro… (2014)

  11. No Access

    Chapter and Conference Paper

    Performance and Fairness for Users in Parallel Job Scheduling

    In this work we analyze the performance of scheduling algorithms with respect to fairness. Existing works frequently consider fairness as a job related issue. In our work we analyze fairness with respect to di...

    Dalibor Klusác̆ek, Hana Rudová in Job Scheduling Strategies for Parallel Processing (2013)

  12. No Access

    Article

    A branch-and-cut procedure for the Udine Course Timetabling problem

    A branch-and-cut procedure for the Udine Course Timetabling problem is described. Simple compact integer linear programming formulations of the problem employ only binary variables. In contrast, we give a form...

    Edmund K. Burke, Jakub Mareček, Andrew J. Parkes in Annals of Operations Research (2012)

  13. No Access

    Chapter and Conference Paper

    Efficient Data Representation of Large Job Schedules

    The increasing popularity of advanced schedule-based techniques designed to solve Grid scheduling problems requires the use of efficient data structures to represent the constructed job schedules. Based on our...

    Dalibor Klusáček, Hana Rudová in Mathematical and Engineering Methods in Computer Science (2012)

  14. No Access

    Article

    Data transfer planning with tree placement for collaborative environments

    Latency-sensitive data distribution and media streaming is a part of many network-centric applications. Based on our previous practical experiences with interactive high-quality media distribution and orchestr...

    Petr Holub, Hana Rudová, Miloš Liška in Constraints (2011)

  15. No Access

    Article

    Complex university course timetabling

    This paper summarizes the work done to solve a complex course timetabling problem at a large university and provides new insights into the overall timetabling process. The first step in the successful solution...

    Hana Rudová, Tomáš Müller, Keith Murray in Journal of Scheduling (2011)

  16. No Access

    Article

    A supernodal formulation of vertex colouring with applications in course timetabling

    For many problems in scheduling and timetabling, the choice of a mathematical programming formulation is determined by the formulation of the graph colouring component. This paper briefly surveys seven known i...

    Edmund K. Burke, Jakub Mareček, Andrew J. Parkes in Annals of Operations Research (2010)

  17. No Access

    Article

    Special issue on applications and methodologies for planning and scheduling: editorial

    Roman Barták, Hana Rudová in Journal of Scheduling (2010)

  18. No Access

    Chapter and Conference Paper

    The Importance of Complete Data Sets for Job Scheduling Simulations

    This paper has been inspired by the study of the complex data set from the Czech National Grid MetaCentrum. Unlike other widely used workloads from Parallel Workloads Archive or Grid Workloads Archive, this da...

    Dalibor Klusáček, Hana Rudová in Job Scheduling Strategies for Parallel Processing (2010)

  19. No Access

    Chapter and Conference Paper

    Alea – Grid Scheduling Simulation Environment

    This work concentrates on the design of a system intended for study of advanced scheduling techniques for planning various types of jobs in a Grid environment. The solution is able to deal with common problems...

    Dalibor Klusáček, Luděk Matyska, Hana Rudová in Parallel Processing and Applied Mathematics (2008)

  20. No Access

    Chapter and Conference Paper

    Penalising Patterns in Timetables: Novel Integer Programming Formulations

    Many complex timetabling problems have an underpinning bounded graph colouring component, a pattern penalisation component and a number of side constraints. The bounded graph colouring component corresponds to...

    Edmund K. Burke, Jakub Mareček, Andrew J. Parkes in Operations Research Proceedings 2007 (2008)

previous disabled Page of 2