Radoslaw Rudek

发表

Operations research methods in political decisions: a case study on the European Parliament composition

Janusz Lyko, Radoslaw Rudek, 2017, Comput. Math. Organ. Theory.

Adam Janiak, Radoslaw Rudek, A. Janiak, 2010, J. Oper. Res. Soc..

Introduction to multi-agent modified Q-learning routing for computer networks

Leszek Koszalka, Iwona Pozniak-Koszalka, Radoslaw Rudek, 2005, Advanced Industrial Conference on Telecommunications/Service Assurance with Partial and Intermittent Resources Conference/E-Learning on Telecommunications Workshop (AICT/SAPIR/ELETE'05).

A note on proving the strong NP-hardness of a scheduling problem with position dependent job processing times

Radoslaw Rudek, Radosław Rudek, 2012, Optimization Letters.

Parallel computation approach to solve total cost minimization scheduling problem

Radoslaw Rudek, Agnieszka Rudek, Tomasz Czyz, 2011, 2011 16th International Conference on Methods & Models in Automation & Robotics.

Optimization of task processing on parallel processors with learning abilities

Radoslaw Rudek, Piotr Skworcow, Andrzej Kozik, 2013, 2013 18th International Conference on Methods & Models in Automation & Robotics (MMAR).

A note on the learning effect in multi-agent optimization

Adam Janiak, Radoslaw Rudek, A. Janiak, 2011, Expert Syst. Appl..

Computational complexity and solution algorithms for flowshop scheduling problems with the learning effect

Radoslaw Rudek, Radosław Rudek, 2011, Comput. Ind. Eng..

The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times

Radoslaw Rudek, Radosław Rudek, 2013, Appl. Math. Comput..

The learning effect: Getting to the core of the problem

Adam Janiak, Radoslaw Rudek, 2007, Inf. Process. Lett..

On Scheduling Problems with an Intelligent Use of the Learning Effect

Adam Janiak, Radoslaw Rudek, Wladyslaw A. Janiak, 2009, 2009 First Asian Conference on Intelligent Information and Database Systems.

Exact and parallel metaheuristic algorithms for the single processor total weighted completion time scheduling problem with the sum-of-processing-time based models

Radoslaw Rudek, Radosław Rudek, 2014, Comput. Oper. Res..

The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect

Radoslaw Rudek, 2012, Appl. Math. Comput..

An Impact of Model Parameter Uncertainty on Scheduling Algorithms

Radoslaw Rudek, Piotr Skworcow, Andrzej Kozik, 2012, ICEIS.

Solution algorithms for the makespan minimization problem with the general learning model

Adam Janiak, Radoslaw Rudek, Wladyslaw A. Janiak, 2009, Comput. Ind. Eng..

A note on optimization in deteriorating systems using scheduling problems with the aging effect and resource allocation models

Radoslaw Rudek, Agnieszka Rudek, 2011, Comput. Math. Appl..

An optimal sequence of tasks for autonomous learning systems

Radoslaw Rudek, Piotr Skworcow, Agnieszka Rudek, 2011, 2011 16th International Conference on Methods & Models in Automation & Robotics.

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

Radoslaw Rudek, Radosław Rudek, 2011, Optimization Letters.

The single processor total weighted completion time scheduling problem with the sum-of-processing-time based learning model

Radoslaw Rudek, Radosław Rudek, 2012, Inf. Sci..

Computational complexity of the single processor makespan minimization problem with release dates and job-dependent learning

Radoslaw Rudek, Radosław Rudek, 2014, J. Oper. Res. Soc..

Resource Allocation Problems in Network Processors for the Future Internet

Pawel Swiatek, Adam Grzech, Radoslaw Rudek, 2012, KES.

Complexity results for single-machine scheduling with positional learning effects

Adam Janiak, Radoslaw Rudek, A. Janiak, 2008, J. Oper. Res. Soc..

On Ordering a Set of Degressively Proportional Apportionments

Janusz Lyko, Radoslaw Rudek, Katarzyna Cegielka, 2017, Trans. Comput. Collect. Intell..

The solution algorithms for the multiprocessor scheduling with workspan criterion

Radoslaw Rudek, Andrzej Kozik, Agnieszka Rudek, 2013, Expert Syst. Appl..

Scheduling problems with position dependent job processing times: computational complexity results

Radoslaw Rudek, 2012, Ann. Oper. Res..

A flowshop scheduling problem with machine deterioration and maintenance activities

Radoslaw Rudek, Agnieszka Rudek, Radosław Rudek, 2012, 2012 17th International Conference on Methods & Models in Automation & Robotics (MMAR).

Beyond the Cambridge Compromise algorithm towards degressively proportional allocations

Janusz Lyko, Radoslaw Rudek, Katarzyna Cegielka, 2019, Oper. Res..

A new approach to the learning effect: Beyond the learning curve restrictions

Adam Janiak, Radoslaw Rudek, A. Janiak, 2008, Comput. Oper. Res..

Scheduling on parallel processors with varying processing times

Radoslaw Rudek, Radosław Rudek, 2017, Comput. Oper. Res..

An Idea of Using Reinforcement Learning in Adaptive Control Systems

Leszek Koszalka, Iwona Pozniak-Koszalka, Radoslaw Rudek, 2006, International Conference on Networking, International Conference on Systems and International Conference on Mobile Communications and Learning Technologies (ICNICONSMCL'06).

A fast exact algorithm for the allocation of seats for the EU Parliament

Janusz Lyko, Radoslaw Rudek, Janusz Lyko, 2013, Expert Syst. Appl..

Makespan minimization flowshop with position dependent job processing times - computational complexity and solution algorithms

Radoslaw Rudek, Agnieszka Rudek, Radosław Rudek, 2013, Comput. Oper. Res..

Experience-Based Approach to Scheduling Problems With the Learning Effect

Adam Janiak, Radoslaw Rudek, A. Janiak, 2009, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

Heuristic workload scheduling algorithms for rolling stocks with mixed preventive maintenance policies

Radoslaw Rudek, Izabela Rudek, 2021, 2021 25th International Conference on Methods and Models in Automation and Robotics (MMAR).