World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
32
Citations
3515
World Ranking
13280
National Ranking
35

Research.com Recognitions

  • 2017 - Polish Academy of Science

Overview

Adam Janiak is affiliated with Wrocław University of Science and Technology in Poland. Their research contributions include work in computational optimization leveraging parallel processing technologies.

Their recent publication is titled Tabu Search on GPU, published in 2020 in TUGraz OPEN Library (Graz University of Technology). This paper focuses on implementing the Tabu Search metaheuristic using graphics processing units to enhance computational efficiency.

The scientist collaborates frequently with co-authors including:

  • Władysław Janiak
  • Maciej Lichtenstein

The primary venue for their published work is the TUGraz OPEN Library (Graz University of Technology).

In 2017, Adam Janiak received recognition from the Polish Academy of Science.

Best Publications

  • Scheduling jobs with position-dependent processing times

    Aleksander Bachman;Adam Janiak

  • Single machine scheduling subject to deadlines and resource dependent processing times

    Adam Janiak;Mikhail Y. Kovalyov

  • Experience-Based Approach to Scheduling Problems With the Learning Effect

    A. Janiak;R. Rudek

  • A survey on scheduling problems with due windows

    Unknown

  • Hybrid flow-shop scheduling problems with multiprocessor task systems

    Ceyda Oğuz;Yakov Zinder;Van Ha Do;Adam Janiak

  • Minimizing the total weighted completion time of deteriorating jobs

    Aleksander Bachman;Adam Janiak;Mikhail Y. Kovalyov

  • Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion

    Adam Janiak;Erhan Kozan;Maciej Lichtenstein;Ceyda Oğuz

  • Minimizing maximum lateness under linear deterioration

    Aleksander Bachman;Adam Janiak

  • Three scheduling problems with deteriorating jobs to minimize the total completion time

    C. T. Ng;T. C. E. Cheng;A. Bachman;A. Janiak

  • Bicriterion Single Machine Scheduling with Resource Dependent Processing Times

    T. C. Edwin Cheng;Adam Janiak;Mikhail Y. Kovalyov

  • Single machine scheduling problem with a common deadline and resource dependent release dates

    Adam Janiak

  • Batching work and rework processes with limited deterioration of reworkables

    Karl Inderfurth;Adam Janiak;Mikhail Y. Kovalyov;Frank Werner

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

    Adam Janiak;Radosław Rudek

  • Scheduling start time dependent jobs to minimize the total weighted completion time

    A Bachman;T C E Cheng;A Janiak;C T Ng

  • Resource optimal control in some single-machine scheduling problems

    T.C.E. Cheng;A. Janiak

  • Scheduling jobs with piecewise linear decreasing processing times

    Edwin Tai Chiu Cheng;Qing Ding;Mikhail Y. Kovalyov;Aleksander Bachman

  • Single machine batch scheduling with resource dependent setup and processing times

    Edwin Tai Chiu Cheng;Adam Janiak;Mikhail Y. Kovalyov

  • Scheduling Problems with Learning and Ageing Effects: A Survey

    Adam Janiak;Tomasz Krysiak;Radosław Trela

  • Group Scheduling with Controllable Setup and Processing Times: Minimizing Total Weighted Completion Time

    Chi To Ng;Edwin Tai Chiu Cheng;Adam Janiak;Mikhail Y. Kovalyov

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

    Adam Janiak;Władysław Adam Janiak;Radosław Rudek;Agnieszka Wielgus

  • A note on a makespan minimization problem with a multi-ability learning effect

    Adam Janiak;RadosŁaw Rudek

Frequent Co-Authors

Mikhail Y. Kovalyov
Mikhail Y. Kovalyov National Academy of Sciences of Belarus
Frank Werner
Frank Werner Otto-von-Guericke University Magdeburg
T.C.E. Cheng
T.C.E. Cheng Hong Kong Polytechnic University
Erhan Kozan
Erhan Kozan Queensland University of Technology
Erwin Pesch
Erwin Pesch University of Siegen

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring online associates degrees is a great starting point for students interested in beginning a career in computer science or related fields. These flexible programs often cover the fundamentals and can act as stepping stones toward a bachelor's degree.

If affordability and speed are important, consider pursuing cheap online degrees fast. Many institutions now offer accelerated and budget-friendly pathways that fit different lifestyles and budgets.

Concerned about your academic background? There are several online graduate programs that accept 2.0 gpa, making advanced study more accessible for students with lower GPAs. This opens doors to career advancement and increased earning potential.

Beyond computer science, it’s good to explore diverse interdisciplinary opportunities. For example, learn what can you do with an environmental studies degree to see how technology and science intersect in careers focused on sustainability, policy, and environmental management.

Best Scientists Citing Adam Janiak

Recently Published Articles