Přemysl Šůcha
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Přemysl Šůcha has a total of 89 co-authors. Here are the top co-authors by number of shared publications:
- Zdeněk Hanzálek
Czech Institute of Informatics Robotics and Cybernetics, Czech Technical University in Prague
32 shared publications - Antonin Novak
Czech Institute of Informatics, Robotics and Cybernetics, Czech Technical University in Prague, Prague, Czech Republic.
5 shared publications - Libor Bukata
Czech Technical University in Prague
4 shared publications - Broos Maenhout
Faculty of Economics and Business Administration, Ghent University, Gent, Belgium
3 shared publications - Cyril Briand
CNRS, LAAS
3 shared publications Roman Václavík
3 shared publications
Latest Publications
- Open Access
- 7 September 2026
- Published by Elsevier in European Journal of Operational Research
Parameterized complexity of scheduling problems in robotic process automation
- 7 September 2026
- Published by Elsevier in European Journal of Operational Research
Open AccessParameterized complexity of scheduling problems in robotic process automation
- Open Access
Parameterized Complexity of Scheduling Problems in Robotic Process Automation
This paper studies the growing domain of Robotic Process Automation (RPA) problems. Motivated by scheduling problems arising in RPA, we study the parameterized complexity of the single-machine problem $1|\text{prec},r_j,d_j|*$. We focus on parameters naturally linked to RPA systems, including chain-like precedences, the number of distinct processing times, and the structure of the time windows. We show that the problem is W[2]-hard parameterized by the number of chains, even with only two prescribed processing times and two distinct time-window lengths. This hardness remains even for distinct processing times and time windows under prec-consistent time windows. On the positive side, we obtain polynomial-time algorithm when all jobs share a single time-window length and FPT when the processing times, release times and deadlines are chain-uniform. We also show that the problem lies in XP when parameterized by the width of the precedence relation.Open AccessParameterized Complexity of Scheduling Problems in Robotic Process Automation
This paper studies the growing domain of Robotic Process Automation (RPA) problems. Motivated by scheduling problems arising in RPA, we study the parameterized complexity of the single-machine problem $1|\text{prec},r_j,d_j|*$. We focus on parameters naturally linked to RPA systems, including chain-like precedences, the number of distinct processing times, and the structure of the time windows. We show that the problem is W[2]-hard parameterized by the number of chains, even with only two prescribed processing times and two distinct time-window lengths. This hardness remains even for distinct processing times and time windows under prec-consistent time windows. On the positive side, we obtain polynomial-time algorithm when all jobs share a single time-window length and FPT when the processing times, release times and deadlines are chain-uniform. We also show that the problem lies in XP when parameterized by the width of the precedence relation. - Open Access
Fast Resource Management Algorithm for Passive Surveillance Systems
Passive surveillance systems (PSS) detect and track objects that emit electromagnetic signals from hundreds of kilometers away. These systems have a limited number of receivers and can only observe a fraction of the frequencies of interest simultaneously. To improve its behavior, we propose the ResourceTune algorithm, which iteratively constructs optimized schedules to determine which frequencies each receiver should observe at a given time step. The algorithm's main component is the optimization of receiver configurations using a left-right heuristic combined with linear programming. Our approach is unique because, unlike others, we focus on optimizing available resources and observed frequencies, which was never done before. We experimentally compared the proposed algorithm with a greedy and the state-of-the-art method for construction of PSS schedules. In most of the considered scenarios, ResourceTune outperformed both algorithms, and in the most extreme case, its objective value was more than 2.7 times better than the values reached by other methods.
Open AccessFast Resource Management Algorithm for Passive Surveillance Systems
Passive surveillance systems (PSS) detect and track objects that emit electromagnetic signals from hundreds of kilometers away. These systems have a limited number of receivers and can only observe a fraction of the frequencies of interest simultaneously. To improve its behavior, we propose the ResourceTune algorithm, which iteratively constructs optimized schedules to determine which frequencies each receiver should observe at a given time step. The algorithm's main component is the optimization of receiver configurations using a left-right heuristic combined with linear programming. Our approach is unique because, unlike others, we focus on optimizing available resources and observed frequencies, which was never done before. We experimentally compared the proposed algorithm with a greedy and the state-of-the-art method for construction of PSS schedules. In most of the considered scenarios, ResourceTune outperformed both algorithms, and in the most extreme case, its objective value was more than 2.7 times better than the values reached by other methods.
- Open Access
A Bilevel Approach to Integrated Surgeon Scheduling and Surgery Planning solved via Branch-and-Price
In this paper, we study a multi-agent scheduling problem for organising the operations within the operating room department. The head of the surgeon group and individual surgeons are together responsible for the surgeon schedule and surgical case planning. The surgeon head allocates time blocks to individual surgeons, whereas individual surgeons determine the planning of surgical cases independently, which might degrade the schedule quality envisaged by the surgeon head. The bilevel optimisation under study seeks an optimal Nash equilibrium solution -- a surgeon schedule and surgical case plan that optimise the objectives of the surgeon head, while ensuring that no individual surgeon can improve their own objective within the allocated time blocks. We propose a dedicated branch-and-price that adds lazy constraints to the formulation of surgeon-specific pricing problems to ensure an optimal bilevel feasible solution is retrieved. In this way, the surgeon head respects the objective requirements of the individual surgeons and the solution space can be searched efficiently. In the computational experiments, we validate the performance of the proposed algorithm and its dedicated components and provide insights into the benefits of attaining an equilibrium solution under different scenarios by calculating the price of stability and the price of decentralisation.
Open AccessA Bilevel Approach to Integrated Surgeon Scheduling and Surgery Planning solved via Branch-and-Price
In this paper, we study a multi-agent scheduling problem for organising the operations within the operating room department. The head of the surgeon group and individual surgeons are together responsible for the surgeon schedule and surgical case planning. The surgeon head allocates time blocks to individual surgeons, whereas individual surgeons determine the planning of surgical cases independently, which might degrade the schedule quality envisaged by the surgeon head. The bilevel optimisation under study seeks an optimal Nash equilibrium solution -- a surgeon schedule and surgical case plan that optimise the objectives of the surgeon head, while ensuring that no individual surgeon can improve their own objective within the allocated time blocks. We propose a dedicated branch-and-price that adds lazy constraints to the formulation of surgeon-specific pricing problems to ensure an optimal bilevel feasible solution is retrieved. In this way, the surgeon head respects the objective requirements of the individual surgeons and the solution space can be searched efficiently. In the computational experiments, we validate the performance of the proposed algorithm and its dedicated components and provide insights into the benefits of attaining an equilibrium solution under different scenarios by calculating the price of stability and the price of decentralisation.
- Open Access
- 27 September 2025
- Published by Elsevier in Computers & Operations Research
- Vol. 185
Minimizing the weighted number of tardy jobs: data-driven heuristic for single-machine scheduling
- 27 September 2025
- Published by Elsevier in Computers & Operations Research
- Vol. 185
Open AccessMinimizing the weighted number of tardy jobs: data-driven heuristic for single-machine scheduling
- Open Access
A bilevel approach to integrated surgeon scheduling and surgery planning solved via branch-and-price
- Open Access
- 27 August 2025
- Published by Wiley in International Transactions in Operational Research
- Vol. 33 (2) , 1016-1051
Purchase and production optimization in a meat processing plant
This paper addresses an optimization problem concerning the purchase and subsequent material processing in a meat processing company. Unlike the majority of existing papers, we do not concentrate on how this problem concerns supply chain management, but we focus on the production stage, primarily the meat cutting. Specifically, we study the operational level of production management, where the company responds to fluctuations in demand and controls the flow of materials, as this level of management significantly affects its profit. The problem involves the concept of alternative ways of material processing, stock of material with different expiration dates, and extra constraints widely neglected in the current literature addressing meat cutting and processing, namely, the minimum order quantity and the minimum percentage in alternatives. We prove that each of these two constraints makes the problem ‐hard, and we design an exact iterative approach based on integer linear programming that allows us to solve real‐life instances even using an open‐source integer linear programming solver. Another advantage of this approach is that it mitigates numerical issues, caused by the extensive range of data values, we experienced with a commercial solver. The results obtained using real data from the meat processing company showed that our algorithm can find the optimum solution in a few seconds for all considered use cases.
- 27 August 2025
- Published by Wiley in International Transactions in Operational Research
- Vol. 33 (2) , 1016-1051
Open AccessPurchase and production optimization in a meat processing plant
This paper addresses an optimization problem concerning the purchase and subsequent material processing in a meat processing company. Unlike the majority of existing papers, we do not concentrate on how this problem concerns supply chain management, but we focus on the production stage, primarily the meat cutting. Specifically, we study the operational level of production management, where the company responds to fluctuations in demand and controls the flow of materials, as this level of management significantly affects its profit. The problem involves the concept of alternative ways of material processing, stock of material with different expiration dates, and extra constraints widely neglected in the current literature addressing meat cutting and processing, namely, the minimum order quantity and the minimum percentage in alternatives. We prove that each of these two constraints makes the problem ‐hard, and we design an exact iterative approach based on integer linear programming that allows us to solve real‐life instances even using an open‐source integer linear programming solver. Another advantage of this approach is that it mitigates numerical issues, caused by the extensive range of data values, we experienced with a commercial solver. The results obtained using real data from the meat processing company showed that our algorithm can find the optimum solution in a few seconds for all considered use cases.
- Open Access
- 20 May 2025
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 203
Thermal modeling and optimal allocation of avionics safety-critical tasks on heterogeneous MPSoCs
- 20 May 2025
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 203
Open AccessThermal modeling and optimal allocation of avionics safety-critical tasks on heterogeneous MPSoCs
- 26 July 2024
- Published by Elsevier in European Journal of Operational Research
- Vol. 320 (2) , 328-342
A machine learning approach to rank pricing problems in branch-and-price
- 26 July 2024
- Published by Elsevier in European Journal of Operational Research
- Vol. 320 (2) , 328-342
A machine learning approach to rank pricing problems in branch-and-price
- Open Access
Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness
In this paper, we investigate the use of the deep learning method for solving a well-known NP-hard single machine scheduling problem with the objective of minimizing the total tardiness. We propose a deep neural network that acts as a polynomial-time estimator of the criterion value used in a single-pass scheduling algorithm based on Lawler's decomposition and symmetric decomposition proposed by Della Croce et al. Essentially, the neural network guides the algorithm by estimating the best splitting of the problem into subproblems. The paper also describes a new method for generating the training data set, which speeds up the training dataset generation and reduces the average optimality gap of solutions. The experimental results show that our machine learning-driven approach can efficiently generalize information from the training phase to significantly larger instances. Even though the instances used in the training phase have from 75 to 100 jobs, the average optimality gap on instances with up to 800 jobs is 0.26%, which is almost five times less than the gap of the state-of-the-art heuristic.
Open AccessDeep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness
In this paper, we investigate the use of the deep learning method for solving a well-known NP-hard single machine scheduling problem with the objective of minimizing the total tardiness. We propose a deep neural network that acts as a polynomial-time estimator of the criterion value used in a single-pass scheduling algorithm based on Lawler's decomposition and symmetric decomposition proposed by Della Croce et al. Essentially, the neural network guides the algorithm by estimating the best splitting of the problem into subproblems. The paper also describes a new method for generating the training data set, which speeds up the training dataset generation and reduces the average optimality gap of solutions. The experimental results show that our machine learning-driven approach can efficiently generalize information from the training phase to significantly larger instances. Even though the instances used in the training phase have from 75 to 100 jobs, the average optimality gap on instances with up to 800 jobs is 0.26%, which is almost five times less than the gap of the state-of-the-art heuristic.