Peter Brucker

14.4k total citations · 3 hit papers
114 papers, 6.3k citations indexed

About

Peter Brucker is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Management Science and Operations Research. According to data from OpenAlex, Peter Brucker has authored 114 papers receiving a total of 6.3k indexed citations (citations by other indexed papers that have themselves been cited), including 97 papers in Industrial and Manufacturing Engineering, 47 papers in Computer Networks and Communications and 22 papers in Management Science and Operations Research. Recurrent topics in Peter Brucker's work include Scheduling and Optimization Algorithms (83 papers), Optimization and Search Problems (42 papers) and Optimization and Packing Problems (38 papers). Peter Brucker is often cited by papers focused on Scheduling and Optimization Algorithms (83 papers), Optimization and Search Problems (42 papers) and Optimization and Packing Problems (38 papers). Peter Brucker collaborates with scholars based in Germany, United Kingdom and Belarus. Peter Brucker's co-authors include Sigrid Knust, Klaus Neumann, Rolf H. Möhring, Erwin Pesch, Andreas Drexl, Bernd Jurisch, Johann L. Hurink, Edmund Burke, Mikhail Y. Kovalyov and Rong Qu and has published in prestigious journals such as European Journal of Operational Research, Journal of the Operational Research Society and Mathematical Programming.

In The Last Decade

Peter Brucker

113 papers receiving 5.8k citations

Hit Papers

Scheduling Algorithms 1990 2026 2002 2014 1995 1999 1990 250 500 750 1000
What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

  1. Scheduling Algorithms
    1995 1.1k citations Peter Brucker profile →
  2. Resource-constrained project scheduling: Notation, classification, models, and methods
    1999 1.0k citations Peter Brucker et al. profile →
  3. Job-shop scheduling with multi-purpose machines
    1990 491 citations Peter Brucker et al. profile →

Author Peers

Peers are selected by citation overlap in the author's most active subfields. citations · hero ref

Author Last Decade Papers Cites
Peter Brucker 5.0k 2.0k 1.9k 531 414 114 6.3k
Erwin Pesch 4.3k 0.9× 1.0k 0.5× 1.4k 0.7× 444 0.8× 269 0.6× 136 5.8k
Alain Hertz 3.3k 0.7× 898 0.4× 1.4k 0.7× 982 1.8× 217 0.5× 165 4.8k
David Connolly 1.8k 0.4× 1.4k 0.7× 352 0.2× 494 0.9× 294 0.7× 6 3.7k
Chris N. Potts 7.1k 1.4× 3.0k 1.5× 424 0.2× 603 1.1× 429 1.0× 120 8.1k
Rolf H. Möhring 1.7k 0.3× 521 0.3× 1.6k 0.8× 162 0.3× 187 0.5× 64 3.0k
Thomas A. Feo 2.0k 0.4× 774 0.4× 331 0.2× 786 1.5× 160 0.4× 27 3.3k
John Hooker 1.5k 0.3× 1.0k 0.5× 473 0.2× 931 1.8× 746 1.8× 110 3.7k
Hans Kellerer 1.7k 0.3× 1.5k 0.8× 517 0.3× 328 0.6× 126 0.3× 93 3.2k
Ulrich Pferschy 1.4k 0.3× 1.2k 0.6× 356 0.2× 379 0.7× 144 0.3× 100 2.9k
Joseph Y.‐T. Leung 3.8k 0.8× 2.7k 1.3× 262 0.1× 310 0.6× 194 0.5× 165 5.8k

Countries citing papers authored by Peter Brucker

Since Specialization
Citations

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

Fields of papers citing papers by Peter Brucker

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Peter Brucker

This figure shows the co-authorship network connecting the top 25 collaborators of Peter Brucker. A scholar is included among the top collaborators of Peter Brucker 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 Peter Brucker. Peter Brucker 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.
Brucker, Peter, et al.. (2012). A mixed integer programming model for the cyclic job-shop problem with transportation. Discrete Applied Mathematics. 160(13-14). 1924–1935. 21 indexed citations
2.
Brucker, Peter, et al.. (2008). A general model for cyclic machine scheduling problems. Discrete Applied Mathematics. 156(13). 2561–2572. 42 indexed citations
3.
Brucker, Peter & Sigrid Knust. (2006). Complex Scheduling (GOR-Publications). Springer eBooks. 40 indexed citations
4.
Brucker, Peter, et al.. (2006). Job-shop scheduling with limited capacity buffers. OR Spectrum. 28(2). 151–176. 38 indexed citations
5.
Brucker, Peter. (2002). Scheduling and constraint propagation. Discrete Applied Mathematics. 123(1-3). 227–256. 47 indexed citations
6.
Brucker, Peter, et al.. (2001). How useful are preemptive schedules. University of Twente Research Information. 1 indexed citations
7.
Brucker, Peter, et al.. (1999). A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags. Discrete Applied Mathematics. 94(1-3). 77–99. 38 indexed citations
8.
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
9.
Brucker, Peter, Johann L. Hurink, & Frank Werner. (1997). Improving local search heuristics for some scheduling problems. Part II. Discrete Applied Mathematics. 72(1-2). 47–69. 47 indexed citations
10.
Brucker, Peter, Johann L. Hurink, & Frank Werner. (1996). Improving local search heuristics for some scheduling problems—I. Discrete Applied Mathematics. 65(1-3). 97–122. 31 indexed citations
11.
Bein, Wolfgang, et al.. (1995). A Monge property for the d-dimensional transportation problem. Discrete Applied Mathematics. 58(2). 97–109. 26 indexed citations
12.
Brucker, Peter. (1994). Generalizations of Shop Scheduling Problems (生産スケジュ-リング ). 33(7). 590–595. 1 indexed citations
13.
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
14.
Albers, Susanne & Peter Brucker. (1993). The complexity of one-machine batching problems. Discrete Applied Mathematics. 47(2). 87–107. 105 indexed citations
15.
Brucker, Peter & W E Meyer. (1988). Scheduling two irregular polygons. Discrete Applied Mathematics. 20(2). 91–100. 4 indexed citations
16.
Bein, Wolfgang & Peter Brucker. (1986). Greedy concepts for network flow problems. Discrete Applied Mathematics. 15(2-3). 135–144. 5 indexed citations
17.
Brucker, Peter & Johann L. Hurink. (1986). A railway scheduling problem. Mathematical Methods of Operations Research. 30(5). A223–A227. 8 indexed citations
18.
Brucker, Peter, et al.. (1985). An out-of-kilter method for the algebraic circulation problem. Discrete Applied Mathematics. 10(1). 1–18. 1 indexed citations
19.
Bein, Wolfgang, Peter Brucker, & Arie Tamir. (1985). Minimum cost flow algorithms for series-parallel networks. Discrete Applied Mathematics. 10(2). 117–124. 39 indexed citations
20.
Brucker, Peter. (1982). Network Flows in Trees and Knapsack Problems with Nested Constraints.. 25–36. 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

Breakdown of academic impact, for papers by Erwin Pesch Breakdown of academic impact, for papers by Alain Hertz Breakdown of academic impact, for papers by David Connolly Breakdown of academic impact, for papers by Chris N. Potts Breakdown of academic impact, for papers by Rolf H. Möhring Breakdown of academic impact, for papers by Thomas A. Feo Breakdown of academic impact, for papers by John Hooker Breakdown of academic impact, for papers by Hans Kellerer Breakdown of academic impact, for papers by Ulrich Pferschy Breakdown of academic impact, for papers by Joseph Y.‐T. Leung
Rankless by CCL
2026