Han Hoogeveen

1.7k total citations
33 papers, 1.1k citations indexed

About

Han Hoogeveen is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Management Science and Operations Research. According to data from OpenAlex, Han Hoogeveen has authored 33 papers receiving a total of 1.1k indexed citations (citations by other indexed papers that have themselves been cited), including 28 papers in Industrial and Manufacturing Engineering, 15 papers in Computer Networks and Communications and 3 papers in Management Science and Operations Research. Recurrent topics in Han Hoogeveen's work include Scheduling and Optimization Algorithms (25 papers), Optimization and Search Problems (15 papers) and Optimization and Packing Problems (11 papers). Han Hoogeveen is often cited by papers focused on Scheduling and Optimization Algorithms (25 papers), Optimization and Search Problems (15 papers) and Optimization and Packing Problems (11 papers). Han Hoogeveen collaborates with scholars based in Netherlands, Germany and Belarus. Han Hoogeveen's co-authors include Gerhard J. Woeginger, Steef van de Velde, Marjan van den Akker, Peter Brucker, Chris N. Potts, Mikhail Y. Kovalyov, Thomas Tautenhahn, Jan Karel Lenstra, Wenci Yu and Martin Skutella and has published in prestigious journals such as European Journal of Operational Research, International Journal of Climatology and Mathematical Programming.

In The Last Decade

Han Hoogeveen

32 papers receiving 1.1k citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Han Hoogeveen Netherlands 14 1.0k 569 83 58 48 33 1.1k
Małgorzata Sterna Poland 17 721 0.7× 325 0.6× 45 0.5× 34 0.6× 37 0.8× 35 773
Radosław Rudek Poland 17 699 0.7× 386 0.7× 44 0.5× 34 0.6× 63 1.3× 48 777
B.J. Lageweg Netherlands 11 787 0.8× 417 0.7× 106 1.3× 73 1.3× 53 1.1× 14 912
Dirk Biskup Germany 14 1.7k 1.6× 792 1.4× 174 2.1× 75 1.3× 73 1.5× 19 1.8k
Michele E. Pfund United States 16 824 0.8× 207 0.4× 86 1.0× 49 0.8× 85 1.8× 32 904
Eugene Levner Israel 18 952 0.9× 332 0.6× 25 0.3× 46 0.8× 43 0.9× 48 1.0k
Milton L. Smith United States 12 1.1k 1.0× 156 0.3× 107 1.3× 47 0.8× 50 1.0× 42 1.2k
Wen-Hung Kuo Taiwan 17 935 0.9× 474 0.8× 90 1.1× 39 0.7× 35 0.7× 31 964
Dar-Li Yang Taiwan 29 2.3k 2.2× 912 1.6× 220 2.7× 79 1.4× 82 1.7× 77 2.3k
Alkis Vazacopoulos United States 8 505 0.5× 170 0.3× 29 0.3× 46 0.8× 58 1.2× 9 590

Countries citing papers authored by Han Hoogeveen

Since Specialization
Citations

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

Fields of papers citing papers by Han Hoogeveen

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Han Hoogeveen

This figure shows the co-authorship network connecting the top 25 collaborators of Han Hoogeveen. A scholar is included among the top collaborators of Han Hoogeveen 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 Han Hoogeveen. Han Hoogeveen 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
2.
Akker, Marjan van den, et al.. (2024). A hybrid local search algorithm for the continuous energy-constrained scheduling problem. Journal of Scheduling. 28(1). 65–84. 1 indexed citations
3.
Haas, Masja de, et al.. (2024). Extensive red blood cell matching considering patient alloimmunization risk. Vox Sanguinis. 119(4). 368–376. 4 indexed citations
4.
Hoogeveen, Han, et al.. (2023). On the complexity of Nurse Rostering problems. Operations Research Letters. 51(5). 483–487. 5 indexed citations
5.
Hoogeveen, Han, et al.. (2021). A Local Search Algorithm for Train Unit Shunting with Service Scheduling. Transportation Science. 56(1). 141–161. 13 indexed citations
6.
Akker, Marjan van den, et al.. (2020). Synchronizing transportation of people with reduced mobility through airport terminals. Computers & Operations Research. 125. 105103–105103. 3 indexed citations
7.
Akker, Marjan van den, et al.. (2018). Combining two-stage stochastic programming and recoverable robustness to minimize the number of late jobs in the case of uncertain processing times. Journal of Scheduling. 21(6). 607–617. 9 indexed citations
8.
Akker, Marjan van den, et al.. (2016). Separating a walkable environment into layers. Data Archiving and Networked Services (DANS). 101–106. 2 indexed citations
9.
Hoogeveen, Han. (2009). Rescheduling for New Orders on a Single Machine with Setup Times. IFAC Proceedings Volumes. 528–532. 1 indexed citations
10.
Hoogeveen, Han, et al.. (2006). Lower bounds for minimizing total completion time in a two-machine flow shop. Journal of Scheduling. 9(6). 559–568. 21 indexed citations
11.
Cheng, T.C.E., Yong He, Han Hoogeveen, Min Ji, & Gerhard J. Woeginger. (2005). Scheduling with step-improving processing times. Operations Research Letters. 34(1). 37–40. 7 indexed citations
12.
Akker, Marjan van den & Han Hoogeveen. (2004). Minimizing the Number of Tardy Jobs.. Acta Crystallographica Section E Structure Reports Online. 64(Pt 10). m1325–m1325. 13 indexed citations
13.
Yu, Wenci, Han Hoogeveen, & Jan Karel Lenstra. (2004). Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard. Journal of Scheduling. 7(5). 333–348. 88 indexed citations
14.
Hoogeveen, Han & Gerhard J. Woeginger. (2002). Some comments on sequencing with controllable processing times. Computing. 68(2). 181–192. 42 indexed citations
15.
Hoogeveen, Han, Petra Schuurman, & Gerhard J. Woeginger. (2001). Non-Approximability Results for Scheduling Problems with Minsum Criteria. INFORMS journal on computing. 13(2). 157–168. 36 indexed citations
16.
Akker, Marjan van den, Han Hoogeveen, & Nodari Vakhania. (2000). Restarts can help in the on-line minimization of the maximum delivery time on a single machine. Journal of Scheduling. 3(6). 333–341. 34 indexed citations
17.
Brucker, Peter, Han Hoogeveen, Mikhail Y. Kovalyov, et al.. (1998). Scheduling a batching machine. Journal of Scheduling. 1(1). 31–54. 11 indexed citations
18.
Brucker, Peter, Han Hoogeveen, Mikhail Y. Kovalyov, et al.. (1998). Scheduling a batching machine. Journal of Scheduling. 1(1). 31–54. 281 indexed citations
19.
Shakhlevich, Natalia V., Han Hoogeveen, & Michael Pinedo. (1998). Minimizing total weighted completion time in a proportionate flow shop. Journal of Scheduling. 1(3). 157–168. 49 indexed citations
20.
Hoogeveen, Han & Steef van de Velde. (1998). Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine. Mathematical Programming. 82(1-2). 273–289. 15 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