default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRadoslaw Rudek
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j31]Radoslaw Rudek
, Izabela Rudek:
TEMPORARY REMOVAL: Models and algorithms for the preventive maintenance optimization of railway vehicles. Expert Syst. Appl. 240: 122589 (2024)- [c13]Radoslaw Rudek:
A neighborhood search relaxation towards railway maintenance optimization. MMAR 2024: 405-410 - 2023
- [c12]Radoslaw Rudek:
An Enhancement of Reinforcement Learning by Scheduling with Learning Effects. FedCSIS 2023: 689-697 - 2022
- [j30]Radoslaw Rudek:
A generic optimization framework for scheduling problems under machine deterioration and maintenance activities. Comput. Ind. Eng. 174: 108800 (2022) - [c11]Tomasz Marchel, Radoslaw Rudek:
Metaheuristics for scheduling on parallel machines under deteriorating and maintenances. MMAR 2022: 222-226 - 2021
- [j29]Radoslaw Rudek:
A fast neighborhood search scheme for identical parallel machine scheduling problems under general learning curves. Appl. Soft Comput. 113(Part): 108023 (2021) - [c10]Izabela Rudek, Radoslaw Rudek:
Heuristic workload scheduling algorithms for rolling stocks with mixed preventive maintenance policies. MMAR 2021: 297-302 - 2020
- [j28]Radoslaw Rudek, Izabela Heppner:
Efficient algorithms for discrete resource allocation problems under degressively proportional constraints. Expert Syst. Appl. 149: 113293 (2020)
2010 – 2019
- 2019
- [j27]Katarzyna Cegielka, Janusz Lyko, Radoslaw Rudek:
Beyond the Cambridge Compromise algorithm towards degressively proportional allocations. Oper. Res. 19(2): 317-332 (2019) - 2018
- [j26]Andrzej Kozik, Radoslaw Rudek:
An approximate/exact objective based search technique for solving general scheduling problems. Appl. Soft Comput. 62: 347-358 (2018) - 2017
- [j25]Janusz Lyko, Radoslaw Rudek:
Operations research methods in political decisions: a case study on the European Parliament composition. Comput. Math. Organ. Theory 23(4): 572-586 (2017) - [j24]Radoslaw Rudek:
Scheduling on parallel processors with varying processing times. Comput. Oper. Res. 81: 90-101 (2017) - [j23]Radoslaw Rudek:
Parallel machine scheduling with general sum of processing time based models. J. Glob. Optim. 68(4): 799-814 (2017) - [j22]Katarzyna Cegielka, Piotr Dniestrzanski, Janusz Lyko, Arkadiusz Maciuk, Radoslaw Rudek:
On Ordering a Set of Degressively Proportional Apportionments. Trans. Comput. Collect. Intell. 27: 53-62 (2017) - 2016
- [j21]Radoslaw Rudek:
Computational complexity and solution algorithms for a vector sequencing problem. Comput. Ind. Eng. 98: 384-400 (2016) - 2014
- [j20]Radoslaw Rudek:
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. 46: 91-101 (2014) - [j19]Radoslaw Rudek:
Computational complexity of the single processor makespan minimization problem with release dates and job-dependent learning. J. Oper. Res. Soc. 65(8): 1170-1176 (2014) - 2013
- [j18]Radoslaw Rudek:
The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times. Appl. Math. Comput. 221: 819-832 (2013) - [j17]Agnieszka Rudek, Radoslaw Rudek:
Makespan minimization flowshop with position dependent job processing times - computational complexity and solution algorithms. Comput. Oper. Res. 40(8): 2071-2082 (2013) - [j16]Radoslaw Rudek, Agnieszka Rudek, Andrzej Kozik:
The solution algorithms for the multiprocessor scheduling with workspan criterion. Expert Syst. Appl. 40(8): 2799-2806 (2013) - [j15]Janusz Lyko, Radoslaw Rudek:
A fast exact algorithm for the allocation of seats for the EU Parliament. Expert Syst. Appl. 40(13): 5284-5291 (2013) - [j14]Radoslaw Rudek:
A note on proving the strong NP-hardness of a scheduling problem with position dependent job processing times. Optim. Lett. 7(3): 613-616 (2013) - [c9]Radoslaw Rudek, Agnieszka Rudek, Andrzej Kozik, Piotr Skworcow:
Optimization of task processing on parallel processors with learning abilities. MMAR 2013: 544-547 - 2012
- [j13]Radoslaw Rudek:
The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect. Appl. Math. Comput. 218(11): 6498-6510 (2012) - [j12]Radoslaw Rudek:
Scheduling problems with position dependent job processing times: computational complexity results. Ann. Oper. Res. 196(1): 491-516 (2012) - [j11]Radoslaw Rudek:
The single processor total weighted completion time scheduling problem with the sum-of-processing-time based learning model. Inf. Sci. 199: 216-229 (2012) - [j10]Radoslaw Rudek:
A note on proving the strong NP-hardness of some scheduling problems with start time dependent job processing times. Optim. Lett. 6(5): 1021-1025 (2012) - [c8]Radoslaw Rudek, Agnieszka Rudek, Andrzej Kozik, Piotr Skworcow:
An Impact of Model Parameter Uncertainty on Scheduling Algorithms. ICEIS (1) 2012: 353-356 - [c7]Andrzej Kozik, Radoslaw Rudek, Pawel Swiatek, Adam Grzech:
Resource Allocation Problems in Network Processors for the Future Internet. KES 2012: 1509-1520 - [c6]Agnieszka Rudek, Radoslaw Rudek:
A flowshop scheduling problem with machine deterioration and maintenance activities. MMAR 2012: 40-45 - 2011
- [j9]Radoslaw Rudek:
Computational complexity and solution algorithms for flowshop scheduling problems with the learning effect. Comput. Ind. Eng. 61(1): 20-31 (2011) - [j8]Agnieszka Rudek, Radoslaw Rudek:
A note on optimization in deteriorating systems using scheduling problems with the aging effect and resource allocation models. Comput. Math. Appl. 62(4): 1870-1878 (2011) - [j7]Adam Janiak, Radoslaw Rudek:
A note on the learning effect in multi-agent optimization. Expert Syst. Appl. 38(5): 5974-5980 (2011) - [c5]Radoslaw Rudek, Agnieszka Rudek, Piotr Skworcow:
An optimal sequence of tasks for autonomous learning systems. MMAR 2011: 16-21 - [c4]Radoslaw Rudek, Agnieszka Rudek, Tomasz Czyz:
Parallel computation approach to solve total cost minimization scheduling problem. MMAR 2011: 22-26 - 2010
- [j6]Adam Janiak, Radoslaw Rudek:
Scheduling jobs under an aging effect. J. Oper. Res. Soc. 61(6): 1041-1048 (2010)
2000 – 2009
- 2009
- [j5]Adam Janiak, Wladyslaw A. Janiak, Radoslaw Rudek, Agnieszka Wielgus:
Solution algorithms for the makespan minimization problem with the general learning model. Comput. Ind. Eng. 56(4): 1301-1308 (2009) - [j4]Adam Janiak, Radoslaw Rudek:
Experience-Based Approach to Scheduling Problems With the Learning Effect. IEEE Trans. Syst. Man Cybern. Part A 39(2): 344-357 (2009) - [c3]Adam Janiak, Radoslaw Rudek, Wladyslaw A. Janiak:
On Scheduling Problems with an Intelligent Use of the Learning Effect. ACIIDS 2009: 7-12 - 2008
- [j3]Adam Janiak, Radoslaw Rudek:
A new approach to the learning effect: Beyond the learning curve restrictions. Comput. Oper. Res. 35(11): 3727-3736 (2008) - [j2]Adam Janiak, Radoslaw Rudek:
Complexity results for single-machine scheduling with positional learning effects. J. Oper. Res. Soc. 59(10): 1430 (2008) - 2007
- [j1]Adam Janiak, Radoslaw Rudek:
The learning effect: Getting to the core of the problem. Inf. Process. Lett. 103(5): 183-187 (2007) - 2006
- [c2]Leszek Koszalka, Radoslaw Rudek, Iwona Pozniak-Koszalka:
An Idea of Using Reinforcement Learning in Adaptive Control Systems. ICN/ICONS/MCL 2006: 190 - 2005
- [c1]Radoslaw Rudek, Leszek Koszalka, Iwona Pozniak-Koszalka:
Introduction to Multi-Agent Modified Q-Learning Routing for Computer Networks. AICT/SAPIR/ELETE 2005: 408-413
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-11 18:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
