J.A. Hoogeveen

2.4k total citations
45 papers, 1.6k citations indexed

About

J.A. 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, J.A. Hoogeveen has authored 45 papers receiving a total of 1.6k indexed citations (citations by other indexed papers that have themselves been cited), including 38 papers in Industrial and Manufacturing Engineering, 27 papers in Computer Networks and Communications and 4 papers in Management Science and Operations Research. Recurrent topics in J.A. Hoogeveen's work include Scheduling and Optimization Algorithms (32 papers), Optimization and Search Problems (25 papers) and Optimization and Packing Problems (13 papers). J.A. Hoogeveen is often cited by papers focused on Scheduling and Optimization Algorithms (32 papers), Optimization and Search Problems (25 papers) and Optimization and Packing Problems (13 papers). J.A. Hoogeveen collaborates with scholars based in Netherlands, United States and Japan. J.A. Hoogeveen's co-authors include Steef van de Velde, Bart Veltman, Marjan van den Akker, Jan Karel Lenstra, Arjen P.A. Vestjens, Guido Diepen, David P. Williamson, L. A. Hall, C.A.J. Hurkens and David B. Shmoys and has published in prestigious journals such as European Journal of Operational Research, Operations Research and Mathematical Programming.

In The Last Decade

J.A. Hoogeveen

44 papers receiving 1.5k citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
J.A. Hoogeveen Netherlands 21 1.4k 682 128 118 94 45 1.6k
Dong‐wan Tcha South Korea 15 506 0.4× 329 0.5× 275 2.1× 105 0.9× 100 1.1× 43 946
François Vanderbeck France 17 943 0.7× 198 0.3× 120 0.9× 100 0.8× 136 1.4× 31 1.2k
Alberto Ceselli Italy 18 604 0.4× 354 0.5× 147 1.1× 50 0.4× 213 2.3× 64 1.1k
José Valério de Carvalho Portugal 20 1.4k 1.1× 199 0.3× 61 0.5× 56 0.5× 81 0.9× 65 1.5k
Marjan van den Akker Netherlands 14 581 0.4× 237 0.3× 115 0.9× 32 0.3× 105 1.1× 53 873
Joel Wein United States 19 918 0.7× 1.2k 1.8× 88 0.7× 191 1.6× 15 0.2× 40 1.6k
Aziz Moukrim France 18 967 0.7× 131 0.2× 47 0.4× 108 0.9× 146 1.6× 69 1.2k
André Rossi France 19 323 0.2× 354 0.5× 255 2.0× 138 1.2× 63 0.7× 64 837
Monaldo Mastrolilli Switzerland 16 962 0.7× 388 0.6× 17 0.1× 127 1.1× 66 0.7× 48 1.2k
Jadranka Skorin‐Kapov United States 12 1.1k 0.8× 229 0.3× 75 0.6× 77 0.7× 92 1.0× 39 1.4k

Countries citing papers authored by J.A. Hoogeveen

Since Specialization
Citations

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

Fields of papers citing papers by J.A. Hoogeveen

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of J.A. Hoogeveen

This figure shows the co-authorship network connecting the top 25 collaborators of J.A. Hoogeveen. A scholar is included among the top collaborators of J.A. 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 J.A. Hoogeveen. J.A. 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
1.
Hoogeveen, J.A., et al.. (2018). How to Measure the Robustness of Shunting Plans. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 65. 3 indexed citations
2.
Akker, Marjan van den, et al.. (2015). Synchronizing transportation of people with reduced mobility through airport terminals. Utrecht University Repository (Utrecht University). 1 indexed citations
3.
Diepen, Guido, et al.. (2012). Finding a robust assignment of flights to gates at Amsterdam Airport Schiphol. Journal of Scheduling. 15(6). 703–715. 39 indexed citations
4.
Akker, Marjan van den, Guido Diepen, & J.A. Hoogeveen. (2010). Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs. Journal of Scheduling. 13(6). 561–576. 21 indexed citations
5.
Akker, Marjan van den, et al.. (2005). Parallel machine scheduling through column generation: minimax objective functions, release dates, deadlines and/or generalized precedence constraints. Utrecht University Repository (Utrecht University). 4 indexed citations
6.
Akker, Marjan van den & J.A. Hoogeveen. (2004). Minimizing the number of late jobs in case of stochastic processing times with minimum succes probabilities. Utrecht University Repository (Utrecht University). 5 indexed citations
7.
Akker, Marjan van den, J.A. Hoogeveen, & Steef van de Velde. (1997). A column generation algorithm for common due date scheduling. University of Twente Research Information. 9701. 2 indexed citations
8.
Hoogeveen, J.A., et al.. (1997). Sequencing and scheduling : an annotated bibliography. Munich Personal RePEc Archive (Ludwig Maximilian University of Munich). 21(1). 5–6. 4 indexed citations
9.
Williamson, David P., L. A. Hall, J.A. Hoogeveen, et al.. (1997). Short Shop Schedules. Operations Research. 45(2). 288–294. 134 indexed citations
10.
Hoogeveen, J.A. & Steef van de Velde. (1997). Earliness-Tardiness Scheduling Around Almost Equal Due Dates. INFORMS journal on computing. 9(1). 92–99. 11 indexed citations
11.
Hoogeveen, J.A.. (1996). Minimizing Maximum Promptness and Maximum Lateness on a Single Machine. Mathematics of Operations Research. 21(1). 100–114. 45 indexed citations
12.
Hoogeveen, J.A. & Steef van de Velde. (1995). . Data Archiving and Networked Services (DANS). 35 indexed citations
13.
Hoogeveen, J.A., Jan Karel Lenstra, & Bart Veltman. (1994). Three, four, five, six, or the complexity of scheduling with communication delays. Operations Research Letters. 16(3). 129–137. 50 indexed citations
14.
Hoogeveen, J.A., et al.. (1992). Complexity of scheduling multiprocessor tasks with prespecified processor allocations. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 1–14. 1 indexed citations
15.
Hoogeveen, J.A., et al.. (1992). Polynomial-time algorithms for single-machine bicriteria scheduling. TU/e Research Portal (Eindhoven University of Technology). 1–13. 3 indexed citations
16.
Hoogeveen, J.A. & Steef van de Velde. (1992). A new lower bound approach for single-machine multicriteria scheduling. Operations Research Letters. 11(1). 39–44. 3 indexed citations
17.
Hoogeveen, J.A.. (1992). Single-machine bicriteria scheduling. Data Archiving and Networked Services (DANS). 54 indexed citations
18.
Hoogeveen, J.A.. (1991). Analysis of Christofides' heuristic: Some paths are more difficult than cycles. Operations Research Letters. 10(5). 291–295. 112 indexed citations
19.
Hoogeveen, J.A.. (1990). Analysis of Christofides' heuristic: some paths are more difficult than cycles. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 1–7. 1 indexed citations
20.
Hoogeveen, J.A.. (1990). Minimizing Maximum Earliness and Maximum Lateness on a Single Machine. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 1–13. 4 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