Eugeniusz Nowicki

2.8k total citations · 1 hit paper
24 papers, 1.9k citations indexed

About

Eugeniusz Nowicki is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Management Science and Operations Research. According to data from OpenAlex, Eugeniusz Nowicki has authored 24 papers receiving a total of 1.9k indexed citations (citations by other indexed papers that have themselves been cited), including 22 papers in Industrial and Manufacturing Engineering, 10 papers in Computer Networks and Communications and 3 papers in Management Science and Operations Research. Recurrent topics in Eugeniusz Nowicki's work include Scheduling and Optimization Algorithms (21 papers), Advanced Manufacturing and Logistics Optimization (17 papers) and Optimization and Search Problems (10 papers). Eugeniusz Nowicki is often cited by papers focused on Scheduling and Optimization Algorithms (21 papers), Advanced Manufacturing and Logistics Optimization (17 papers) and Optimization and Search Problems (10 papers). Eugeniusz Nowicki collaborates with scholars based in Poland. Eugeniusz Nowicki's co-authors include Czesław Smutnicki, Stanisław Zdrzałka and Janusz Grabowski and has published in prestigious journals such as Management Science, European Journal of Operational Research and Journal of the Operational Research Society.

In The Last Decade

Eugeniusz Nowicki

23 papers receiving 1.8k citations

Hit Papers

A Fast Taboo Search Algorithm for the Job Shop Problem 1996 2026 2006 2016 1996 200 400 600

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Eugeniusz Nowicki Poland 15 1.8k 580 362 142 108 24 1.9k
Czesław Smutnicki Poland 14 1.4k 0.8× 368 0.6× 319 0.9× 124 0.9× 91 0.8× 44 1.5k
E. Emory Enscore United States 7 2.1k 1.1× 392 0.7× 247 0.7× 151 1.1× 60 0.6× 15 2.1k
S. S. Panwalkar United States 16 2.2k 1.2× 737 1.3× 151 0.4× 138 1.0× 127 1.2× 48 2.3k
Güneş Gençyılmaz Türkiye 6 580 0.3× 188 0.3× 291 0.8× 91 0.6× 40 0.4× 8 768
Débora P. Ronconi Brazil 19 1.0k 0.6× 153 0.3× 127 0.4× 102 0.7× 52 0.5× 41 1.1k
Camino R. Vela Spain 18 721 0.4× 136 0.2× 202 0.6× 109 0.8× 66 0.6× 51 920
Yuri N. Sotskov Belarus 20 890 0.5× 228 0.4× 53 0.1× 96 0.7× 114 1.1× 82 1.0k
Weishi Shao China 27 1.5k 0.8× 200 0.3× 326 0.9× 234 1.6× 26 0.2× 40 1.6k
Wim Nuijten Netherlands 9 496 0.3× 333 0.6× 102 0.3× 53 0.4× 226 2.1× 19 690
Ramiro Varela Spain 18 600 0.3× 152 0.3× 281 0.8× 82 0.6× 68 0.6× 53 800

Countries citing papers authored by Eugeniusz Nowicki

Since Specialization
Citations

This map shows the geographic impact of Eugeniusz Nowicki's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Eugeniusz Nowicki with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Eugeniusz Nowicki more than expected).

Fields of papers citing papers by Eugeniusz Nowicki

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Eugeniusz Nowicki. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Eugeniusz Nowicki. The network helps show where Eugeniusz Nowicki may publish in the future.

Co-authorship network of co-authors of Eugeniusz Nowicki

This figure shows the co-authorship network connecting the top 25 collaborators of Eugeniusz Nowicki. A scholar is included among the top collaborators of Eugeniusz Nowicki based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Eugeniusz Nowicki. Eugeniusz Nowicki is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Nowicki, Eugeniusz. (1999). The permutation flow shop with buffers: A tabu search approach. European Journal of Operational Research. 116(1). 205–219. 85 indexed citations
2.
Nowicki, Eugeniusz & Czesław Smutnicki. (1998). The flow shop with parallel machines: A tabu search approach. European Journal of Operational Research. 106(2-3). 226–253. 118 indexed citations
3.
Nowicki, Eugeniusz & Czesław Smutnicki. (1996). A Fast Taboo Search Algorithm for the Job Shop Problem. Management Science. 42(6). 797–813. 655 indexed citations breakdown →
4.
Nowicki, Eugeniusz & Czesław Smutnicki. (1996). A fast tabu search algorithm for the permutation flow-shop problem. European Journal of Operational Research. 91(1). 160–175. 316 indexed citations
5.
Nowicki, Eugeniusz & Stanisław Zdrzałka. (1996). Single Machine Scheduling with Major and Minor Setup Times: A Tabu Search Approach. Journal of the Operational Research Society. 47(8). 1054–1064. 9 indexed citations
6.
Nowicki, Eugeniusz & Stanisław Zdrzałka. (1995). A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times. Discrete Applied Mathematics. 63(3). 237–256. 28 indexed citations
7.
Nowicki, Eugeniusz & Czesław Smutnicki. (1994). An approximation algorithm for a single-machine scheduling problem with release times and delivery times. Discrete Applied Mathematics. 48(1). 69–79. 24 indexed citations
8.
Nowicki, Eugeniusz & Czesław Smutnicki. (1994). A decision support system for the resource constrained project scheduling problem. European Journal of Operational Research. 79(2). 183–195. 4 indexed citations
9.
Nowicki, Eugeniusz & Czesław Smutnicki. (1994). A note on worst-case analysis of approximation algorithms for a scheduling problem. European Journal of Operational Research. 74(1). 128–134. 7 indexed citations
10.
Nowicki, Eugeniusz. (1994). An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times. European Journal of Operational Research. 72(1). 74–81. 10 indexed citations
11.
Nowicki, Eugeniusz. (1993). An approximation algorithm for the m-machine permutation flow shop scheduling problem with controllable processing times. European Journal of Operational Research. 70(3). 342–349. 20 indexed citations
12.
Nowicki, Eugeniusz & Czesław Smutnicki. (1993). New results in the worst-case analysis for flow-shop scheduling. Discrete Applied Mathematics. 46(1). 21–41. 20 indexed citations
13.
Nowicki, Eugeniusz & Czesław Smutnicki. (1991). Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling. Operations Research Letters. 10(8). 473–480. 14 indexed citations
14.
Nowicki, Eugeniusz & Stanisław Zdrzałka. (1990). A survey of results for sequencing problems with controllable processing times. Discrete Applied Mathematics. 26(2-3). 271–287. 161 indexed citations
15.
Nowicki, Eugeniusz & Czesław Smutnicki. (1989). Worst-case analysis of an approximation algorithm for flow-shop scheduling. Operations Research Letters. 8(3). 171–177. 29 indexed citations
16.
Nowicki, Eugeniusz & Stanisław Zdrzałka. (1988). A two-machine flow shop scheduling problem with controllable job processing times. European Journal of Operational Research. 34(2). 208–220. 41 indexed citations
17.
Grabowski, Janusz, Eugeniusz Nowicki, & Stanisław Zdrzałka. (1986). A block approach for single-machine scheduling with release dates and due dates. European Journal of Operational Research. 26(2). 278–285. 100 indexed citations
18.
Nowicki, Eugeniusz & Stanisław Zdrzałka. (1984). Scheduling jobs with controllable processing times as an optimal control problem. International Journal of Control. 39(4). 839–848. 3 indexed citations
19.
Nowicki, Eugeniusz & Stanisław Zdrzałka. (1984). Optimal control policies for resource allocation in an activity network. European Journal of Operational Research. 16(2). 198–214. 7 indexed citations
20.
Nowicki, Eugeniusz & Stanisław Zdrzałka. (1981). Optimal control of a complex of independent operations. International Journal of Systems Science. 12(1). 77–93. 3 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026