Radoslaw Rudek

Orcid: 0000-0002-5945-4803

According to our database1, Radoslaw Rudek authored at least 44 papers between 2005 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
TEMPORARY REMOVAL: Models and algorithms for the preventive maintenance optimization of railway vehicles.
Expert Syst. Appl., 2024

A neighborhood search relaxation towards railway maintenance optimization.
Proceedings of the 28th International Conference on Methods and Models in Automation and Robotics, 2024

2023
An Enhancement of Reinforcement Learning by Scheduling with Learning Effects.
Proceedings of the 18th Conference on Computer Science and Intelligence Systems, 2023

2022
A generic optimization framework for scheduling problems under machine deterioration and maintenance activities.
Comput. Ind. Eng., 2022

Metaheuristics for scheduling on parallel machines under deteriorating and maintenances.
Proceedings of the 26th International Conference on Methods and Models in Automation and Robotics, 2022

2021
A fast neighborhood search scheme for identical parallel machine scheduling problems under general learning curves.
Appl. Soft Comput., 2021

Heuristic workload scheduling algorithms for rolling stocks with mixed preventive maintenance policies.
Proceedings of the 25th International Conference on Methods and Models in Automation and Robotics, 2021

2020
Efficient algorithms for discrete resource allocation problems under degressively proportional constraints.
Expert Syst. Appl., 2020

2019
Beyond the Cambridge Compromise algorithm towards degressively proportional allocations.
Oper. Res., 2019

2018
An approximate/exact objective based search technique for solving general scheduling problems.
Appl. Soft Comput., 2018

2017
On Ordering a Set of Degressively Proportional Apportionments.
Trans. Comput. Collect. Intell., 2017

Parallel machine scheduling with general sum of processing time based models.
J. Glob. Optim., 2017

Scheduling on parallel processors with varying processing times.
Comput. Oper. Res., 2017

Operations research methods in political decisions: a case study on the European Parliament composition.
Comput. Math. Organ. Theory, 2017

2016
Computational complexity and solution algorithms for a vector sequencing problem.
Comput. Ind. Eng., 2016

2014
Computational complexity of the single processor makespan minimization problem with release dates and job-dependent learning.
J. Oper. Res. Soc., 2014

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., 2014

2013
A note on proving the strong NP-hardness of a scheduling problem with position dependent job processing times.
Optim. Lett., 2013

The solution algorithms for the multiprocessor scheduling with workspan criterion.
Expert Syst. Appl., 2013

A fast exact algorithm for the allocation of seats for the EU Parliament.
Expert Syst. Appl., 2013

Makespan minimization flowshop with position dependent job processing times - computational complexity and solution algorithms.
Comput. Oper. Res., 2013

The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times.
Appl. Math. Comput., 2013

Optimization of task processing on parallel processors with learning abilities.
Proceedings of the 18th International Conference on Methods & Models in Automation & Robotics, 2013

2012
A note on proving the strong NP-hardness of some scheduling problems with start time dependent job processing times.
Optim. Lett., 2012

The single processor total weighted completion time scheduling problem with the sum-of-processing-time based learning model.
Inf. Sci., 2012

Scheduling problems with position dependent job processing times: computational complexity results.
Ann. Oper. Res., 2012

The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect.
Appl. Math. Comput., 2012

A flowshop scheduling problem with machine deterioration and maintenance activities.
Proceedings of the 17th International Conference on Methods & Models in Automation & Robotics, 2012

Resource Allocation Problems in Network Processors for the Future Internet.
Proceedings of the Advances in Knowledge-Based and Intelligent Information and Engineering Systems, 2012

An Impact of Model Parameter Uncertainty on Scheduling Algorithms.
Proceedings of the ICEIS 2012 - Proceedings of the 14th International Conference on Enterprise Information Systems, Volume 1, Wroclaw, Poland, 28 June, 2012

2011
A note on the learning effect in multi-agent optimization.
Expert Syst. Appl., 2011

A note on optimization in deteriorating systems using scheduling problems with the aging effect and resource allocation models.
Comput. Math. Appl., 2011

Computational complexity and solution algorithms for flowshop scheduling problems with the learning effect.
Comput. Ind. Eng., 2011

An optimal sequence of tasks for autonomous learning systems.
Proceedings of the 16th International Conference on Methods and Models in Automation and Robotics, 2011

Parallel computation approach to solve total cost minimization scheduling problem.
Proceedings of the 16th International Conference on Methods and Models in Automation and Robotics, 2011

2010
Scheduling jobs under an aging effect.
J. Oper. Res. Soc., 2010

2009
Experience-Based Approach to Scheduling Problems With the Learning Effect.
IEEE Trans. Syst. Man Cybern. Part A, 2009

Solution algorithms for the makespan minimization problem with the general learning model.
Comput. Ind. Eng., 2009

On Scheduling Problems with an Intelligent Use of the Learning Effect.
Proceedings of the First Asian Conference on Intelligent Information and Database Systems, 2009

2008
Complexity results for single-machine scheduling with positional learning effects.
J. Oper. Res. Soc., 2008

A new approach to the learning effect: Beyond the learning curve restrictions.
Comput. Oper. Res., 2008

2007
The learning effect: Getting to the core of the problem.
Inf. Process. Lett., 2007

2006
An Idea of Using Reinforcement Learning in Adaptive Control Systems.
Proceedings of the Fifth International Conference on Networking and the International Conference on Systems (ICN / ICONS / MCL 2006), 2006

2005
Introduction to Multi-Agent Modified Q-Learning Routing for Computer Networks.
Proceedings of the Telecommunications 2005: Advanced Industrial Conference on Telecommunications / Service Assurance with Partial and Intermittent Resources Conference / E-Learning on Telecommunications Workshop (AICT / SAPIR / ELETE 2005), 2005


  Loading...