Radoslaw Puka

According to our database, Radoslaw Puka authored at least 7 papers between 2021 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2024

Deterministic constructive <i>vN</i>-NEH+ algorithm to solve permutation flow shop scheduling problem with makespan criterion.

Radoslaw Puka, Iwona Skalna, Jerzy Duda, Adam Stawowy

Comput. Oper. Res., February, 2024

Deterministic Method for Input Sequence Modification in NEH-Based Algorithms.

Radoslaw Puka, Iwona Skalna, Bartosz Lamasz, Jerzy Duda, Adam Stawowy

IEEE Access, 2024

2023

New measures of algorithms quality for permutation flow-shop scheduling problem.

Radoslaw Puka, Iwona Skalna, Tomasz Derlecki

Proceedings of the 18th Conference on Computer Science and Intelligence Systems, 2023

2022

Improving N-NEH+ algorithm by using Starting Point method.

Radoslaw Puka, Bartosz Lamasz, Iwona Skalna

Proceedings of the 17th Conference on Computer Science and Intelligence Systems, 2022

2021

A New Measure of Complementarity in Market Basket Data.

Radoslaw Puka, Stanislaw Jedrusik

J. Theor. Appl. Electron. Commer. Res., 2021

<i>N</i>-NEH+ algorithm for solving permutation flow shop problems.

Radoslaw Puka, Jerzy Duda, Adam Stawowy, Iwona Skalna

Comput. Oper. Res., 2021

Decision rules-based method for dynamic adjustment of Min-Max ordering levels.

Radoslaw Puka, Iwona Skalna, Adam Stawowy, Jerzy Duda, Marek Karkula

Appl. Soft Comput., 2021