B.J. Lageweg

1.4k total citations
14 papers, 912 citations indexed

About

B.J. Lageweg is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Management Information Systems. According to data from OpenAlex, B.J. Lageweg has authored 14 papers receiving a total of 912 indexed citations (citations by other indexed papers that have themselves been cited), including 14 papers in Industrial and Manufacturing Engineering, 5 papers in Computer Networks and Communications and 1 paper in Management Information Systems. Recurrent topics in B.J. Lageweg's work include Scheduling and Optimization Algorithms (14 papers), Optimization and Packing Problems (6 papers) and Assembly Line Balancing Optimization (4 papers). B.J. Lageweg is often cited by papers focused on Scheduling and Optimization Algorithms (14 papers), Optimization and Packing Problems (6 papers) and Assembly Line Balancing Optimization (4 papers). B.J. Lageweg collaborates with scholars based in Netherlands, United States and Canada. B.J. Lageweg's co-authors include Jan Karel Lenstra, A. H. G. Rinnooy Kan, Bart Veltman, Marshall L. Fisher, Eugene L. Lawler, M. A. H. Dempster, Leo Jansen, Mohamed I. Dessouky, Steef van de Velde and Leen Stougie and has published in prestigious journals such as Management Science, Communications of the ACM and Operations Research.

In The Last Decade

B.J. Lageweg

14 papers receiving 842 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
B.J. Lageweg Netherlands 11 787 417 106 73 65 14 912
Jianzhong Du United States 7 763 1.0× 504 1.2× 118 1.1× 82 1.1× 100 1.5× 14 935
Celia A. Glass United Kingdom 18 680 0.9× 294 0.7× 68 0.6× 121 1.7× 47 0.7× 38 853
Han Hoogeveen Netherlands 14 1.0k 1.3× 569 1.4× 83 0.8× 58 0.8× 48 0.7× 33 1.1k
D.J. Hoitomt United States 7 538 0.7× 169 0.4× 54 0.5× 46 0.6× 36 0.6× 15 622
Valery Gordon Belarus 17 1.0k 1.3× 519 1.2× 177 1.7× 54 0.7× 42 0.6× 38 1.2k
I. Adiri Israel 13 491 0.6× 268 0.6× 193 1.8× 70 1.0× 30 0.5× 25 693
Wim Nuijten Netherlands 9 496 0.6× 333 0.8× 34 0.3× 226 3.1× 102 1.6× 19 690
S. S. Panwalkar United States 16 2.2k 2.8× 737 1.8× 273 2.6× 127 1.7× 151 2.3× 48 2.3k
Yuri N. Sotskov Belarus 20 890 1.1× 228 0.5× 65 0.6× 114 1.6× 53 0.8× 82 1.0k
Eugene Levner Israel 18 952 1.2× 332 0.8× 25 0.2× 46 0.6× 22 0.3× 48 1.0k

Countries citing papers authored by B.J. Lageweg

Since Specialization
Citations

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

Fields of papers citing papers by B.J. Lageweg

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of B.J. Lageweg

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

All Works

14 of 14 papers shown
1.
Veltman, Bart, B.J. Lageweg, & Jan Karel Lenstra. (1990). Multiprocessor scheduling with communication delays. Parallel Computing. 16(2-3). 173–182. 113 indexed citations
2.
Dessouky, Mohamed I., B.J. Lageweg, Jan Karel Lenstra, & Steef van de Velde. (1990). Scheduling identical jobs on uniform parallel machines. Statistica Neerlandica. 44(3). 115–123. 58 indexed citations
3.
Lageweg, B.J., et al.. (1985). STOCHASTIC INTEGER PROGRAMMING BY DYNAMIC PROGRAMMING. Statistica Neerlandica. 39(2). 97–113. 9 indexed citations
4.
Fisher, Marshall L., B.J. Lageweg, Jan Karel Lenstra, & A. H. G. Rinnooy Kan. (1983). Surrogate duality relaxation for job shop scheduling. Discrete Applied Mathematics. 5(1). 65–75. 32 indexed citations
5.
Dempster, M. A. H., Marshall L. Fisher, Leo Jansen, et al.. (1983). Analysis of Heuristics for Stochastic Programming: Results for Hierarchical Scheduling Problems. Mathematics of Operations Research. 8(4). 525–537. 37 indexed citations
6.
Lageweg, B.J., Jan Karel Lenstra, Eugene L. Lawler, & A. H. G. Rinnooy Kan. (1982). Computer-Aided complexity classification of combinational problems. Communications of the ACM. 25(11). 817–822. 29 indexed citations
7.
Dempster, M. A. H., Marshall L. Fisher, Leo Jansen, et al.. (1981). Analysis of heuristics for stochastic programming: results for hierarchical scheduling problems : (preprint). Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 1–23. 1 indexed citations
8.
Lageweg, B.J., Eugene L. Lawler, Jan Karel Lenstra, & A. H. G. Rinnooy Kan. (1981). Computer aided complexity classification of deterministic scheduling problems. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 1–20. 39 indexed citations
9.
Dempster, M. A. H., Marshall L. Fisher, Leo Jansen, et al.. (1981). Analytical Evaluation of Hierarchical Planning Systems. Operations Research. 29(4). 707–716. 70 indexed citations
10.
Lageweg, B.J., Jan Karel Lenstra, & A. H. G. Rinnooy Kan. (1978). A General Bounding Scheme for the Permutation Flow-Shop Problem. Operations Research. 26(1). 53–67. 155 indexed citations
11.
Lageweg, B.J., Jan Karel Lenstra, & A. H. G. Rinnooy Kan. (1977). Job-Shop Scheduling by Implicit Enumeration. Management Science. 24(4). 441–450. 131 indexed citations
12.
Lageweg, B.J., Eugene L. Lawler, & Jan Karel Lenstra. (1976). Machine scheduling problems; computations, complexity and classification : In honour of A.G.H. Rinnooy Kan upon the occasion of the defense of his doctoral thesis, 28.01.1976. Data Archiving and Networked Services (DANS). 1–94. 2 indexed citations
13.
Lageweg, B.J., et al.. (1976). Minimizing maximum lateness on one machine: computational experience and some applications. Statistica Neerlandica. 30(1). 25–41. 85 indexed citations
14.
Kan, A. H. G. Rinnooy, B.J. Lageweg, & Jan Karel Lenstra. (1975). Minimizing Total Costs in One-Machine Scheduling. Operations Research. 23(5). 908–927. 151 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