Lingfa Lu

812 total citations
41 papers, 624 citations indexed

About

Lingfa Lu is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Management Information Systems. According to data from OpenAlex, Lingfa Lu has authored 41 papers receiving a total of 624 indexed citations (citations by other indexed papers that have themselves been cited), including 41 papers in Industrial and Manufacturing Engineering, 28 papers in Computer Networks and Communications and 1 paper in Management Information Systems. Recurrent topics in Lingfa Lu's work include Scheduling and Optimization Algorithms (41 papers), Advanced Manufacturing and Logistics Optimization (34 papers) and Optimization and Search Problems (28 papers). Lingfa Lu is often cited by papers focused on Scheduling and Optimization Algorithms (41 papers), Advanced Manufacturing and Logistics Optimization (34 papers) and Optimization and Search Problems (28 papers). Lingfa Lu collaborates with scholars based in China, Hong Kong and Taiwan. Lingfa Lu's co-authors include Jinjiang Yuan, Liqi Zhang, Liqi Zhang, C.T. Ng, Liqi Zhang, T.C.E. Cheng, Jinwen Ou, Ameur Soukhal, Shisheng Li and Rubing Chen and has published in prestigious journals such as European Journal of Operational Research, International Journal of Production Economics and Journal of the Operational Research Society.

In The Last Decade

Lingfa Lu

37 papers receiving 607 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Lingfa Lu China	14	604	334	73	29	17	41	624
Daniel Oron Australia	18	697 1.2×	384 1.1×	78 1.1×	22 0.8×	27 1.6×	43	718
Baruch Mor Israel	17	825 1.4×	481 1.4×	140 1.9×	23 0.8×	14 0.8×	63	847
Chuanli Zhao China	13	659 1.1×	268 0.8×	49 0.7×	17 0.6×	18 1.1×	55	688
Yuan-Yuan Lu China	14	409 0.7×	242 0.7×	24 0.3×	21 0.7×	14 0.8×	32	457
Guoqing Wang China	12	912 1.5×	375 1.1×	73 1.0×	34 1.2×	35 2.1×	19	939
Surya Danusaputro Liman United States	9	382 0.6×	179 0.5×	59 0.8×	14 0.5×	16 0.9×	18	403
Ameur Soukhal France	12	556 0.9×	275 0.8×	53 0.7×	21 0.7×	50 2.9×	24	577
Stanisław Gawiejnowicz Poland	18	1.2k 2.0×	657 2.0×	88 1.2×	24 0.8×	67 3.9×	35	1.2k
H.M. Soroush Kuwait	10	405 0.7×	114 0.3×	117 1.6×	40 1.4×	48 2.8×	31	460
Wen-Hung Wu Taiwan	12	433 0.7×	204 0.6×	29 0.4×	20 0.7×	18 1.1×	20	451

Countries citing papers authored by Lingfa Lu

Since Specialization

Citations

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

Fields of papers citing papers by Lingfa Lu

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Lingfa Lu

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

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Lu, Lingfa, et al.. (2025). Multiple identical serial-batch machines scheduling with release dates and submodular rejection penalties. Journal of Combinatorial Optimization. 49(2). 2 indexed citations

Lu, Lingfa, et al.. (2025). Order acceptance and scheduling with weighted makespan. 4OR. 23(3). 247–267.

Lu, Lingfa, Jinwen Ou, Xue Yu, & Liqi Zhang. (2023). Order acceptance and scheduling with delivery under generalized parameters. Naval Research Logistics (NRL). 70(8). 844–857. 2 indexed citations

Lu, Lingfa & Liqi Zhang. (2023). Scheduling problems with rejection to minimize the k-th power of the makespan plus the total rejection cost. Journal of Combinatorial Optimization. 46(1).

Lu, Lingfa, et al.. (2023). Online scheduling on a single machine with one restart for all jobs to minimize the weighted makespan. AIMS Mathematics. 9(1). 2518–2529.

Lu, Lingfa, et al.. (2022). Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work. Naval Research Logistics (NRL). 69(5). 816–837. 9 indexed citations

Chen, Rubing, et al.. (2021). Pareto-scheduling of two competing agents with their own equal processing times. European Journal of Operational Research. 301(2). 414–431. 9 indexed citations

Chen, Rubing, Jinjiang Yuan, & Lingfa Lu. (2019). Single-machine scheduling with positional due indices and positional deadlines. Discrete Optimization. 34. 100549–100549. 5 indexed citations

Lu, Lingfa, et al.. (2018). Improved Approximation Algorithm for Scheduling on a Serial Batch Machine with Split-Allowed Delivery. Journal of the Operations Research Society of China. 8(1). 133–143. 3 indexed citations

10.

Zhang, Liqi & Lingfa Lu. (2016). Parallel-machine scheduling with release dates and rejection. 4OR. 14(2). 165–172. 32 indexed citations

11.

Lu, Lingfa, et al.. (2015). Integrated production and delivery scheduling on a serial batch machine to minimize the makespan. Theoretical Computer Science. 572. 50–57. 7 indexed citations

12.

Lu, Lingfa, et al.. (2015). Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time. Theoretical Computer Science. 583. 67–77. 8 indexed citations

13.

Zhang, Liqi, Lingfa Lu, & Jinjiang Yuan. (2015). Two-machine open-shop scheduling with rejection to minimize the makespan. OR Spectrum. 38(2). 519–529. 9 indexed citations

14.

Zhang, Liqi, Lingfa Lu, & Jinjiang Yuan. (2010). Single-machine scheduling under the job rejection constraint. Theoretical Computer Science. 411(16-18). 1877–1882. 53 indexed citations

15.

Lu, Lingfa, Liqi Zhang, & Jinjiang Yuan. (2008). The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan. Theoretical Computer Science. 396(1-3). 283–289. 63 indexed citations

16.

Lu, Lingfa & Jinjiang Yuan. (2008). Unbounded parallel batch scheduling with job delivery to minimize makespan. Operations Research Letters. 36(4). 477–480. 16 indexed citations

17.

Lu, Lingfa & Jinjiang Yuan. (2008). SINGLE MACHINE SCHEDULING WITH JOB DELIVERY TO MINIMIZE MAKESPAN. Asia Pacific Journal of Operational Research. 25(1). 1–10. 13 indexed citations

18.

Lu, Lingfa, T.C.E. Cheng, Jinjiang Yuan, & Liqi Zhang. (2008). Bounded single-machine parallel-batch scheduling with release dates and rejection. Computers & Operations Research. 36(10). 2748–2751. 50 indexed citations

19.

Lu, Lingfa, Jinjiang Yuan, & Liqi Zhang. (2007). Single machine scheduling with release dates and job delivery to minimize the makespan. Theoretical Computer Science. 393(1-3). 102–108. 30 indexed citations

20.

Lu, Lingfa & Jinjiang Yuan. (2006). The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard. European Journal of Operational Research. 177(2). 1302–1309. 17 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