Joachim Breit

411 total citations
8 papers, 327 citations indexed

About

Joachim Breit is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Infectious Diseases. According to data from OpenAlex, Joachim Breit has authored 8 papers receiving a total of 327 indexed citations (citations by other indexed papers that have themselves been cited), including 8 papers in Industrial and Manufacturing Engineering, 6 papers in Computer Networks and Communications and 0 papers in Infectious Diseases. Recurrent topics in Joachim Breit's work include Scheduling and Optimization Algorithms (8 papers), Optimization and Search Problems (6 papers) and Advanced Manufacturing and Logistics Optimization (6 papers). Joachim Breit is often cited by papers focused on Scheduling and Optimization Algorithms (8 papers), Optimization and Search Problems (6 papers) and Advanced Manufacturing and Logistics Optimization (6 papers). Joachim Breit collaborates with scholars based in Germany, United Kingdom and Canada. Joachim Breit's co-authors include Günter Schmidt, Piotr Formanowicz, Jacek Błażewicz, Wiesław Kubiak and Vitaly A. Strusevich and has published in prestigious journals such as European Journal of Operational Research, Computers & Operations Research and Omega.

In The Last Decade

Joachim Breit

8 papers receiving 301 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Joachim Breit Germany 8 317 96 16 11 11 8 327
Kabir Rustogi United Kingdom 9 316 1.0× 124 1.3× 29 1.8× 12 1.1× 9 0.8× 11 330
Xin-Na Geng China 11 342 1.1× 213 2.2× 23 1.4× 8 0.7× 6 0.5× 17 360
Assaf Sarig Israel 12 348 1.1× 146 1.5× 38 2.4× 11 1.0× 26 2.4× 22 358
Andreas Klemmt Germany 10 329 1.0× 43 0.4× 22 1.4× 6 0.5× 40 3.6× 34 349
Xue Huang China 17 677 2.1× 342 3.6× 40 2.5× 3 0.3× 11 1.0× 34 687
J-B Wang China 8 424 1.3× 232 2.4× 15 0.9× 1 0.1× 12 1.1× 8 425
Ammar Oulamara France 10 330 1.0× 101 1.1× 9 0.6× 1 0.1× 9 0.8× 23 344
Hwan-Yong Lee South Korea 3 322 1.0× 23 0.2× 19 1.2× 2 0.2× 3 0.3× 4 342
Fan T. Tseng United States 8 335 1.1× 64 0.7× 33 2.1× 20 1.8× 18 352
Harlan C. Meal United States 2 151 0.5× 24 0.3× 29 1.8× 10 0.9× 3 163

Countries citing papers authored by Joachim Breit

Since Specialization
Citations

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

Fields of papers citing papers by Joachim Breit

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Joachim Breit

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

All Works

8 of 8 papers shown
1.
Breit, Joachim. (2006). Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint. European Journal of Operational Research. 183(2). 516–524. 37 indexed citations
2.
Strusevich, Vitaly A., et al.. (2005). Polynomial‐time approximation schemes for two‐machine open shop scheduling with nonavailability constraints. Naval Research Logistics (NRL). 53(1). 16–23. 10 indexed citations
3.
Breit, Joachim. (2005). A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint. Computers & Operations Research. 33(8). 2143–2153. 31 indexed citations
4.
Breit, Joachim. (2004). An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint. Information Processing Letters. 90(6). 273–278. 37 indexed citations
5.
Breit, Joachim, Günter Schmidt, & Vitaly A. Strusevich. (2003). Non-preemptive two-machine open shop scheduling with non-availability constraints. Mathematical Methods of Operations Research. 57(2). 217–234. 27 indexed citations
6.
Kubiak, Wiesław, Jacek Błażewicz, Piotr Formanowicz, Joachim Breit, & Günter Schmidt. (2002). Two-machine flow shops with limited machine availability. European Journal of Operational Research. 136(3). 528–540. 97 indexed citations
7.
Breit, Joachim, Günter Schmidt, & Vitaly A. Strusevich. (2001). Two-machine open shop scheduling with an availability constraint. Operations Research Letters. 29(2). 65–77. 29 indexed citations
8.
Błażewicz, Jacek, Joachim Breit, Piotr Formanowicz, Wiesław Kubiak, & Günter Schmidt. (2001). Heuristic algorithms for the two-machine flowshop with limited machine availability. Omega. 29(6). 599–608. 59 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