Radoslaw Rudek

46 papers B 2C 2Misc 8Journal 31Unranked 3
YearRankTypeTitle / Venue / Authors
2025 Misc conf
A Parallel Branch and Bound Algorithm for a Rolling Stock Cyclic Job Scheduling Problem to Minimize the Total Maintenance Cost.
MMAR
Radoslaw Rudek
2025 C conf
Metaheuristics for Rolling Stock Cyclic Job Scheduling Problems with Maintenance.
FedCSIS
Radoslaw Rudek
2024 Misc conf
A neighborhood search relaxation towards railway maintenance optimization.
MMAR
Radoslaw Rudek
2024 J jnl
TEMPORARY REMOVAL: Models and algorithms for the preventive maintenance optimization of railway vehicles.
Expert Syst. Appl.
Radoslaw Rudek, Izabela Rudek
2023 C conf
An Enhancement of Reinforcement Learning by Scheduling with Learning Effects.
FedCSIS
Radoslaw Rudek
2022 J jnl
A generic optimization framework for scheduling problems under machine deterioration and maintenance activities.
Comput. Ind. Eng.
Radoslaw Rudek
2022 Misc conf
Metaheuristics for scheduling on parallel machines under deteriorating and maintenances.
MMAR
Tomasz Marchel, Radoslaw Rudek
2021 J jnl
A fast neighborhood search scheme for identical parallel machine scheduling problems under general learning curves.
Appl. Soft Comput.
Radoslaw Rudek
2021 Misc conf
Heuristic workload scheduling algorithms for rolling stocks with mixed preventive maintenance policies.
MMAR
Izabela Rudek, Radoslaw Rudek
2020 J jnl
Efficient algorithms for discrete resource allocation problems under degressively proportional constraints.
Expert Syst. Appl.
Radoslaw Rudek, Izabela Heppner
2019 J jnl
Beyond the Cambridge Compromise algorithm towards degressively proportional allocations.
Oper. Res.
Katarzyna Cegielka, Janusz Lyko, Radoslaw Rudek
2018 J jnl
An approximate/exact objective based search technique for solving general scheduling problems.
Appl. Soft Comput.
Andrzej Kozik, Radoslaw Rudek
2017 J jnl
On Ordering a Set of Degressively Proportional Apportionments.
Trans. Comput. Collect. Intell.
Katarzyna Cegielka, Piotr Dniestrzanski, Janusz Lyko, Arkadiusz Maciuk, Radoslaw Rudek
2017 J jnl
Operations research methods in political decisions: a case study on the European Parliament composition.
Comput. Math. Organ. Theory
Janusz Lyko, Radoslaw Rudek
2017 J jnl
Parallel machine scheduling with general sum of processing time based models.
J. Glob. Optim.
Radoslaw Rudek
2017 J jnl
Scheduling on parallel processors with varying processing times.
Comput. Oper. Res.
Radoslaw Rudek
2016 J jnl
Computational complexity and solution algorithms for a vector sequencing problem.
Comput. Ind. Eng.
Radoslaw Rudek
2014 J jnl
Computational complexity of the single processor makespan minimization problem with release dates and job-dependent learning.
J. Oper. Res. Soc.
Radoslaw Rudek
2014 J jnl
Exact and parallel metaheuristic algorithms for the single processor total weighted completion time scheduling problem with the sum-of-processing-time based models.
Comput. Oper. Res.
Radoslaw Rudek
2013 J jnl
A fast exact algorithm for the allocation of seats for the EU Parliament.
Expert Syst. Appl.
Janusz Lyko, Radoslaw Rudek
2013 J jnl
A note on proving the strong NP-hardness of a scheduling problem with position dependent job processing times.
Optim. Lett.
Radoslaw Rudek
2013 J jnl
Makespan minimization flowshop with position dependent job processing times - computational complexity and solution algorithms.
Comput. Oper. Res.
Agnieszka Rudek, Radoslaw Rudek
2013 Misc conf
Optimization of task processing on parallel processors with learning abilities.
MMAR
Radoslaw Rudek, Agnieszka Rudek, Andrzej Kozik, Piotr Skworcow
2013 J jnl
The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times.
Appl. Math. Comput.
Radoslaw Rudek
2013 J jnl
The solution algorithms for the multiprocessor scheduling with workspan criterion.
Expert Syst. Appl.
Radoslaw Rudek, Agnieszka Rudek, Andrzej Kozik
2012 Misc conf
A flowshop scheduling problem with machine deterioration and maintenance activities.
MMAR
Agnieszka Rudek, Radoslaw Rudek
2012 J jnl
A note on proving the strong NP-hardness of some scheduling problems with start time dependent job processing times.
Optim. Lett.
Radoslaw Rudek
2012 — conf
An Impact of Model Parameter Uncertainty on Scheduling Algorithms.
ICEIS (1)
Radoslaw Rudek, Agnieszka Rudek, Andrzej Kozik, Piotr Skworcow
2012 B conf
Resource Allocation Problems in Network Processors for the Future Internet.
KES
Andrzej Kozik, Radoslaw Rudek, Pawel Swiatek, Adam Grzech
2012 J jnl
Scheduling problems with position dependent job processing times: computational complexity results.
Ann. Oper. Res.
Radoslaw Rudek
2012 J jnl
The single processor total weighted completion time scheduling problem with the sum-of-processing-time based learning model.
Inf. Sci.
Radoslaw Rudek
2012 J jnl
The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect.
Appl. Math. Comput.
Radoslaw Rudek
2011 J jnl
A note on optimization in deteriorating systems using scheduling problems with the aging effect and resource allocation models.
Comput. Math. Appl.
Agnieszka Rudek, Radoslaw Rudek
2011 J jnl
A note on the learning effect in multi-agent optimization.
Expert Syst. Appl.
Adam Janiak, Radoslaw Rudek
2011 Misc conf
An optimal sequence of tasks for autonomous learning systems.
MMAR
Radoslaw Rudek, Agnieszka Rudek, Piotr Skworcow
2011 J jnl
Computational complexity and solution algorithms for flowshop scheduling problems with the learning effect.
Comput. Ind. Eng.
Radoslaw Rudek
2011 Misc conf
Parallel computation approach to solve total cost minimization scheduling problem.
MMAR
Radoslaw Rudek, Agnieszka Rudek, Tomasz Czyz
2010 J jnl
Scheduling jobs under an aging effect.
J. Oper. Res. Soc.
Adam Janiak, Radoslaw Rudek
2009 J jnl
Experience-Based Approach to Scheduling Problems With the Learning Effect.
IEEE Trans. Syst. Man Cybern. Part A
Adam Janiak, Radoslaw Rudek
2009 B conf
On Scheduling Problems with an Intelligent Use of the Learning Effect.
ACIIDS
Adam Janiak, Radoslaw Rudek, Wladyslaw A. Janiak
2009 J jnl
Solution algorithms for the makespan minimization problem with the general learning model.
Comput. Ind. Eng.
Adam Janiak, Wladyslaw A. Janiak, Radoslaw Rudek, Agnieszka Wielgus
2008 J jnl
A new approach to the learning effect: Beyond the learning curve restrictions.
Comput. Oper. Res.
Adam Janiak, Radoslaw Rudek
2008 J jnl
Complexity results for single-machine scheduling with positional learning effects.
J. Oper. Res. Soc.
Adam Janiak, Radoslaw Rudek
2007 J jnl
The learning effect: Getting to the core of the problem.
Inf. Process. Lett.
Adam Janiak, Radoslaw Rudek
2006 — conf
An Idea of Using Reinforcement Learning in Adaptive Control Systems.
ICN/ICONS/MCL
Leszek Koszalka, Radoslaw Rudek, Iwona Pozniak-Koszalka
2005 — conf
Introduction to Multi-Agent Modified Q-Learning Routing for Computer Networks.
AICT/SAPIR/ELETE
Radoslaw Rudek, Leszek Koszalka, Iwona Pozniak-Koszalka
2025 Best paper conf
Assessing the Effectiveness of the Tigress Obfuscator Against MOPSA and BinaryNinja.
CheckMATE
Nicolò Altamura, Enrico Bragastini, Marco Campion, Mila Dalla Preda
2026 Best paper preprint
ASSEMBLAGE-DEEPHISTORY: A Cross-Build Binary Dataset with Temporal Coverage.
arXiv
Chang Liu, Noah Fleischmann, Nicolò Altamura, Edward Raff, James Holt, Kristopher Micinski