Radoslaw Rudek

Prof. Radoslaw Rudek

orcid

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
20 January 2009 in IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans
Verified
Journal Article
Closed access
AJAdam Janiak
Adam Janiak
RRRadoslaw Rudek
Radoslaw Rudek
The existence of the learning effect in many manufacturing systems is undoubted; thus, it is worthwhile that it be taken into consideration during production planning to increase production efficiency. Generally, it can be done by formulating the specified problem in the scheduling context and optimizing an order of jobs to minimize the given time criteria. To carry out a reliable study of the learning effect in scheduling fields, a comprehensive survey of the related results is presented first. It reveals that most of the learning models in scheduling are based on the learning curve introduced by Wright. However, further study about learning itself pointed out that the curve may be an ldquoSrdquo-shaped function, which has not been considered in the scheduling domain. To fill this gap, we analyze a scheduling problem with a new experience-based learning model, where job processing times are described by ldquoSrdquo-shaped functions that are dependent on the experience of the processor. Moreover, problems with other experience-based learning models are also taken into consideration. We prove that the makespan minimization problem on a single processor is NP-hard or strongly NP-hard with the most of the considered learning models. A number of polynomially solvable cases are also provided.

1 November 2008 in Computers & Operations Research
Verified
Journal Article
Closed access
AJAdam Janiak
Adam Janiak
RRRadoslaw Rudek
Radoslaw Rudek

1 June 2010 in Omega
Verified
Journal Article
Closed access
AJAdam Janiak
Adam Janiak
RRRadoslaw Rudek
Radoslaw Rudek

1 August 2011 in Computers & Industrial Engineering
Verified
Journal Article
Closed access
RRRadoslaw Rudek
Radoslaw Rudek

31 July 2008 in Computers & Industrial Engineering
Verified
Journal Article
Closed access
AJAdam Janiak
Adam Janiak
WJWładysław Adam Janiak
Władysław Adam Janiak
RRRadoslaw Rudek
Radoslaw Rudek
AWAgnieszka Wielgus
Agnieszka Wielgus

29 February 2012 in Annals of Operations Research
Verified
Journal Article
Open access
PDF file
RRRadoslaw Rudek
Radoslaw Rudek
In this paper, we analyse single machine scheduling problems with learning and aging effects to minimize one of the following objectives: the makespan with release dates, the maximum lateness and the number of late jobs. The phenomena of learning and aging are modeled by job processing times described by non-increasing (learning) or non-decreasing (aging) functions dependent on the number of previously processed jobs, i.e., a job position in a sequence. We prove that the considered problems are strongly NP-hard even if job processing times are described by simple linear functions dependent on a number of processed jobs. Additionally, we show a property of equivalence between problems with learning and aging models. We also prove that if the function describing decrease/increase of a job processing time is the same for each job then the problems with the considered objectives are polynomially solvable even if the function is arbitrary. Therefore, we determine the boundary between polynomially solvable and strongly NP-hard cases.