Thomas Tautenhahn

892 total citations
20 papers, 640 citations indexed

About

Thomas Tautenhahn is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Management Information Systems. According to data from OpenAlex, Thomas Tautenhahn has authored 20 papers receiving a total of 640 indexed citations (citations by other indexed papers that have themselves been cited), including 19 papers in Industrial and Manufacturing Engineering, 13 papers in Computer Networks and Communications and 1 paper in Management Information Systems. Recurrent topics in Thomas Tautenhahn's work include Scheduling and Optimization Algorithms (19 papers), Optimization and Search Problems (12 papers) and Optimization and Packing Problems (11 papers). Thomas Tautenhahn is often cited by papers focused on Scheduling and Optimization Algorithms (19 papers), Optimization and Search Problems (12 papers) and Optimization and Packing Problems (11 papers). Thomas Tautenhahn collaborates with scholars based in Germany, Austria and Belarus. Thomas Tautenhahn's co-authors include Chris N. Potts, Frank Werner, Peter Brucker, Han Hoogeveen, Steef van de Velde, Mikhail Y. Kovalyov, Gerhard J. Woeginger, Hans Kellerer, Yuri N. Sotskov and Vitaly A. Strusevich and has published in prestigious journals such as European Journal of Operational Research, Operations Research and SIAM Journal on Computing.

In The Last Decade

Thomas Tautenhahn

19 papers receiving 601 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Thomas Tautenhahn Germany 12 608 355 34 32 30 20 640
Stanisław Zdrzałka Poland 9 437 0.7× 201 0.6× 10 0.3× 15 0.5× 21 0.7× 13 452
Irfan M. Ovacik United States 10 597 1.0× 159 0.4× 41 1.2× 19 0.6× 36 1.2× 15 639
Ameur Soukhal France 12 556 0.9× 275 0.8× 21 0.6× 16 0.5× 50 1.7× 24 577
Guoqing Wang China 12 912 1.5× 375 1.1× 34 1.0× 21 0.7× 35 1.2× 19 939
Ling‐Huey Su Taiwan 11 378 0.6× 101 0.3× 19 0.6× 14 0.4× 32 1.1× 31 405
Svetlana A. Kravchenko Belarus 15 566 0.9× 324 0.9× 7 0.2× 20 0.6× 18 0.6× 35 606
Yu. N. Sotskov Belarus 10 375 0.6× 111 0.3× 44 1.3× 32 1.0× 36 1.2× 20 430
J. Erschler France 10 267 0.4× 100 0.3× 47 1.4× 30 0.9× 71 2.4× 21 328
Józef Grabowski Poland 7 733 1.2× 188 0.5× 84 2.5× 19 0.6× 34 1.1× 9 766
Lingfa Lu China 14 604 1.0× 334 0.9× 29 0.9× 8 0.3× 17 0.6× 41 624

Countries citing papers authored by Thomas Tautenhahn

Since Specialization
Citations

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

Fields of papers citing papers by Thomas Tautenhahn

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Thomas Tautenhahn

This figure shows the co-authorship network connecting the top 25 collaborators of Thomas Tautenhahn. A scholar is included among the top collaborators of Thomas Tautenhahn 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 Thomas Tautenhahn. Thomas Tautenhahn 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.
Tautenhahn, Thomas, et al.. (2007). Heuristic constructive algorithms for open shop scheduling to minimize mean flow time. European Journal of Operational Research. 189(3). 856–870. 32 indexed citations
2.
Tautenhahn, Thomas, et al.. (2006). A COMPARISON OF HEURISTICS FOR MEAN FLOW TIME OPEN SHOP SCHEDULING. IFAC Proceedings Volumes. 39(3). 119–124. 1 indexed citations
3.
Potts, Chris N., Vitaly A. Strusevich, & Thomas Tautenhahn. (2001). Scheduling batches with simultaneous job processing for two-machine shop problems. Journal of Scheduling. 4(1). 25–51. 34 indexed citations
4.
Tautenhahn, Thomas, et al.. (1999). On the set of solutions of the open shop problem. Annals of Operations Research. 92(0). 241–263. 8 indexed citations
5.
Sotskov, Yuri N., Thomas Tautenhahn, & Frank Werner. (1999). On the application of insertion techniques for job shop problems with setup times. RAIRO - Operations Research. 33(2). 209–245. 24 indexed citations
6.
Tautenhahn, Thomas, et al.. (1999). A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size. Mathematical and Computer Modelling. 29(9). 101–126. 34 indexed citations
7.
Glass, Celia A., et al.. (1999). Scheduling multi‐operation jobs on a single machine. Annals of Operations Research. 92(0). 87–105. 25 indexed citations
8.
Kellerer, Hans G., Thomas Tautenhahn, & Gerhard J. Woeginger. (1999). Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine. SIAM Journal on Computing. 28(4). 1155–1166. 28 indexed citations
9.
Tautenhahn, Thomas, et al.. (1999). On the hardness of the classical job shop problem. Annals of Operations Research. 92(0). 265–279. 4 indexed citations
10.
Brucker, Peter, Han Hoogeveen, Mikhail Y. Kovalyov, et al.. (1998). Scheduling a batching machine. Journal of Scheduling. 1(1). 31–54. 11 indexed citations
11.
Brucker, Peter, Han Hoogeveen, Mikhail Y. Kovalyov, et al.. (1998). Scheduling a batching machine. Journal of Scheduling. 1(1). 31–54. 281 indexed citations
12.
Tautenhahn, Thomas & Gerhard J. Woeginger. (1997). Minimizing the total completion time in a unit-time open shop with release times. Operations Research Letters. 20(5). 207–212. 7 indexed citations
13.
Tautenhahn, Thomas & Gerhard J. Woeginger. (1997). Unit-time scheduling problems with time dependent resources. Computing. 58(2). 97–111. 12 indexed citations
14.
Tautenhahn, Thomas. (1996). On unit time open shops with additional restrictions. Mathematical Methods of Operations Research. 43(2). 215–231. 1 indexed citations
15.
Sotskov, Yuri N., Thomas Tautenhahn, & Frank Werner. (1996). Heuristics for permutation flow shop scheduling with batch setup times. OR Spectrum. 18(2). 67–80. 16 indexed citations
16.
Kellerer, Hans, Thomas Tautenhahn, & Gerhard J. Woeginger. (1996). Approximability and nonapproximability results for minimizing total flow time on a single machine. TU/e Research Portal. 418–426. 52 indexed citations
17.
Kellerer, Hans, Thomas Tautenhahn, & Gerhard J. Woeginger. (1995). Note: Open-shop scheduling with release dates to minimize maximum lateness. Naval Research Logistics (NRL). 42(1). 141–145. 3 indexed citations
18.
Tautenhahn, Thomas. (1994). Scheduling Unit-Time Open Shops with Deadlines. Operations Research. 42(1). 189–192. 7 indexed citations
19.
Tautenhahn, Thomas, et al.. (1993). Constructive heuristic algorithms for the open shop problem. Computing. 51(2). 95–110. 52 indexed citations
20.
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

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