Bernd Jurisch

1.5k total citations
13 papers, 1.0k citations indexed

About

Bernd Jurisch is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Infectious Diseases. According to data from OpenAlex, Bernd Jurisch has authored 13 papers receiving a total of 1.0k indexed citations (citations by other indexed papers that have themselves been cited), including 13 papers in Industrial and Manufacturing Engineering, 9 papers in Computer Networks and Communications and 0 papers in Infectious Diseases. Recurrent topics in Bernd Jurisch's work include Scheduling and Optimization Algorithms (13 papers), Optimization and Search Problems (9 papers) and Advanced Manufacturing and Logistics Optimization (8 papers). Bernd Jurisch is often cited by papers focused on Scheduling and Optimization Algorithms (13 papers), Optimization and Search Problems (9 papers) and Advanced Manufacturing and Logistics Optimization (8 papers). Bernd Jurisch collaborates with scholars based in Germany and Canada. Bernd Jurisch's co-authors include Peter Brucker, Johann L. Hurink, Andreas Krämer, Wiesław Kubiak, Joanna Józefowska, Thomas Tautenhahn and Frank Werner and has published in prestigious journals such as European Journal of Operational Research, Operations Research and Annals of Operations Research.

In The Last Decade

Bernd Jurisch

13 papers receiving 942 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Bernd Jurisch Germany 10 978 347 182 74 73 13 1.0k
Józef Grabowski Poland 7 733 0.7× 188 0.5× 111 0.6× 34 0.5× 84 1.2× 9 766
Nhu Binh Ho Singapore 6 652 0.7× 95 0.3× 258 1.4× 33 0.4× 127 1.7× 7 707
Gianfranco Ciaschetti Italy 4 664 0.7× 162 0.5× 167 0.9× 23 0.3× 88 1.2× 5 741
A.M.A. Hariri United Kingdom 13 572 0.6× 207 0.6× 24 0.1× 54 0.7× 39 0.5× 16 690
Peng-Jen Lai Taiwan 12 422 0.4× 162 0.5× 43 0.2× 36 0.5× 57 0.8× 23 498
Manzhan Gu China 9 235 0.2× 100 0.3× 85 0.5× 27 0.4× 35 0.5× 21 331
Abderrahmane Aggoun Poland 6 127 0.1× 304 0.9× 188 1.0× 99 1.3× 17 0.2× 10 447
Charles Fleurent Canada 6 245 0.3× 90 0.3× 105 0.6× 203 2.7× 16 0.2× 6 369
Stanisław Gawiejnowicz Poland 18 1.2k 1.2× 657 1.9× 25 0.1× 67 0.9× 24 0.3× 35 1.2k
Irfan M. Ovacik United States 10 597 0.6× 159 0.5× 20 0.1× 36 0.5× 41 0.6× 15 639

Countries citing papers authored by Bernd Jurisch

Since Specialization
Citations

This map shows the geographic impact of Bernd Jurisch'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 Bernd Jurisch with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Bernd Jurisch more than expected).

Fields of papers citing papers by Bernd Jurisch

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Bernd Jurisch. 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 Bernd Jurisch. The network helps show where Bernd Jurisch may publish in the future.

Co-authorship network of co-authors of Bernd Jurisch

This figure shows the co-authorship network connecting the top 25 collaborators of Bernd Jurisch. A scholar is included among the top collaborators of Bernd Jurisch 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 Bernd Jurisch. Bernd Jurisch is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

13 of 13 papers shown
1.
Jurisch, Bernd, Wiesław Kubiak, & Joanna Józefowska. (1997). Algorithms for minclique scheduling problems. Discrete Applied Mathematics. 72(1-2). 115–139. 21 indexed citations
2.
Brucker, Peter, et al.. (1997). A branch & bound algorithm for the open-shop problem. Discrete Applied Mathematics. 76(1-3). 43–59. 97 indexed citations
3.
Brucker, Peter, Bernd Jurisch, & Andreas Krämer. (1997). Complexity of scheduling problems with multi-purpose machines. Annals of Operations Research. 70(0). 57–73. 50 indexed citations
4.
Jurisch, Bernd & Wiesław Kubiak. (1997). Two-Machine Open Shops with Renewable Resources. Operations Research. 45(4). 544–552. 9 indexed citations
5.
Jurisch, Bernd. (1995). Lower bounds for the job-shop scheduling problem on multi-purpose machines. Discrete Applied Mathematics. 58(2). 145–156. 16 indexed citations
6.
Brucker, Peter, et al.. (1994). A branch and bound algorithm for the job-shop scheduling problem. Discrete Applied Mathematics. 49(1-3). 107–127. 318 indexed citations
7.
Józefowska, Joanna, Bernd Jurisch, & Wiesław Kubiak. (1994). Scheduling shops to minimize the weighted number of late jobs. Operations Research Letters. 16(5). 277–283. 34 indexed citations
8.
Hurink, Johann L., et al.. (1994). Tabu search for the job-shop scheduling problem with multi-purpose machines. OR Spectrum. 15(4). 205–215. 371 indexed citations
9.
Brucker, Peter, Bernd Jurisch, & Andreas Krämer. (1994). The job-shop problem and immediate selection. Annals of Operations Research. 50(1). 73–114. 26 indexed citations
10.
Brucker, Peter, Bernd Jurisch, Thomas Tautenhahn, & Frank Werner. (1993). Scheduling unit time open shops to minimize the weighted number of late jobs. Operations Research Letters. 14(5). 245–250. 8 indexed citations
11.
Brucker, Peter, et al.. (1993). Open shop problems with unit time operations. Mathematical Methods of Operations Research. 37(1). 59–73. 36 indexed citations
12.
Brucker, Peter & Bernd Jurisch. (1993). A new lower bound for the job-shop scheduling problem. European Journal of Operational Research. 64(2). 156–167. 21 indexed citations
13.
Brucker, Peter, et al.. (1992). Job-shop (C codes). European Journal of Operational Research. 57(1). 132–133. 6 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