Bertrand M.T. Lin

3.1k total citations · 1 hit paper
114 papers, 2.5k citations indexed

About

Bertrand M.T. Lin is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Management Science and Operations Research. According to data from OpenAlex, Bertrand M.T. Lin has authored 114 papers receiving a total of 2.5k indexed citations (citations by other indexed papers that have themselves been cited), including 95 papers in Industrial and Manufacturing Engineering, 46 papers in Computer Networks and Communications and 14 papers in Management Science and Operations Research. Recurrent topics in Bertrand M.T. Lin's work include Scheduling and Optimization Algorithms (90 papers), Advanced Manufacturing and Logistics Optimization (63 papers) and Assembly Line Balancing Optimization (40 papers). Bertrand M.T. Lin is often cited by papers focused on Scheduling and Optimization Algorithms (90 papers), Advanced Manufacturing and Logistics Optimization (63 papers) and Assembly Line Balancing Optimization (40 papers). Bertrand M.T. Lin collaborates with scholars based in Taiwan, Hong Kong and United States. Bertrand M.T. Lin's co-authors include T.C.E. Cheng, Qingqing Ding, Shyong Jian Shyu, Chung‐Yee Lee, Peng-Yeng Yin, Feng-Jang Hwang, Mikhail Y. Kovalyov, Feng‐Cheng Lin, Yeu‐Shiang Huang and Gwo‐Jen Hwang and has published in prestigious journals such as Management Science, European Journal of Operational Research and IEEE Access.

In The Last Decade

Bertrand M.T. Lin

107 papers receiving 2.4k citations

Hit Papers

A concise survey of scheduling with time-dependent proces... 2003 2026 2010 2018 2003 100 200 300 400 500
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. A concise survey of scheduling with time-dependent processing times
    2003 545 citations T.C.E. Cheng, Bertrand M.T. Lin et al. European Journal of Operational Research profile →

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Bertrand M.T. Lin Taiwan 25 2.1k 738 161 159 146 114 2.5k
Imed Kacem France 19 1.8k 0.8× 541 0.7× 91 0.6× 418 2.6× 67 0.5× 102 2.1k
Christos Koulamas United States 21 2.0k 0.9× 726 1.0× 108 0.7× 137 0.9× 283 1.9× 118 2.2k
Vitaly A. Strusevich United Kingdom 29 2.6k 1.2× 977 1.3× 119 0.7× 66 0.4× 145 1.0× 118 2.7k
Francisco Maturana United States 18 712 0.3× 242 0.3× 98 0.6× 272 1.7× 196 1.3× 70 1.2k
Brian Rodrigues Singapore 23 1.1k 0.5× 222 0.3× 296 1.8× 134 0.8× 245 1.7× 79 1.7k
Artur Alves Pessoa Brazil 23 1.3k 0.6× 198 0.3× 103 0.6× 222 1.4× 48 0.3× 68 1.6k
Saïd Hanafi France 23 1.1k 0.5× 363 0.5× 95 0.6× 236 1.5× 53 0.4× 90 1.5k
Sanja Petrović United Kingdom 17 1.2k 0.5× 181 0.2× 200 1.2× 252 1.6× 127 0.9× 34 1.4k
Paul Valckenaers Belgium 24 2.0k 1.0× 202 0.3× 138 0.9× 236 1.5× 310 2.1× 117 2.5k
Richard W. Conway United States 7 1.3k 0.6× 566 0.8× 184 1.1× 140 0.9× 329 2.3× 16 1.8k

Countries citing papers authored by Bertrand M.T. Lin

Since Specialization
Citations

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

Fields of papers citing papers by Bertrand M.T. Lin

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Bertrand M.T. Lin

This figure shows the co-authorship network connecting the top 25 collaborators of Bertrand M.T. Lin. A scholar is included among the top collaborators of Bertrand M.T. Lin 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 Bertrand M.T. Lin. Bertrand M.T. Lin 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.
Tanaka, Shunji & Bertrand M.T. Lin. (2025). Single‐Machine Scheduling to Minimize the Size of Input Buffer. Naval Research Logistics (NRL). 72(6). 810–824.
2.
Lin, Bertrand M.T., et al.. (2024). Deep Q-Networks for Minimizing Total Tardiness on a Single Machine. Mathematics. 13(1). 62–62. 1 indexed citations
3.
Lazarev, A. A., Frank Werner, & Bertrand M.T. Lin. (2024). Special Issue “Recent Advances of Discrete Optimization and Scheduling”. Mathematics. 12(6). 793–793.
4.
Lin, Bertrand M.T., Shuwei Liu, & Gur Mosheiov. (2024). Scheduling with a weight-modifying activity to minimize the total weighted completion time. Omega. 128. 103115–103115.
5.
Gupta, Jatinder N.D., Chin‐Chia Wu, Win-Chin Lin, et al.. (2023). Bicriteria single-machine scheduling with multiple job classes and customer orders. Applied Soft Computing. 147. 110809–110809. 1 indexed citations
6.
Gawiejnowicz, Stanisław, Bertrand M.T. Lin, & Gur Mosheiov. (2023). Dynamic scheduling problems in theory and practice. Journal of Scheduling. 27(3). 225–226.
7.
Li, Han-Lin, Shu‐Cherng Fang, Bertrand M.T. Lin, & Way Kuo. (2023). Unifying colors by primes. Light Science & Applications. 12(1). 32–32. 7 indexed citations
8.
Lin, Bertrand M.T., et al.. (2023). Scheduling of Software Test to Minimize the Total Completion Time. Mathematics. 11(22). 4705–4705. 1 indexed citations
9.
Dolgui, Alexandre, Mikhail Y. Kovalyov, & Bertrand M.T. Lin. (2022). Maximizing total early work in a distributed two‐machine flow‐shop. Naval Research Logistics (NRL). 69(8). 1124–1137. 7 indexed citations
10.
Lin, Bertrand M.T., et al.. (2021). Relocation Scheduling in a Two-Machine Flow Shop with Resource Recycling Operations. Mathematics. 9(13). 1527–1527. 3 indexed citations
11.
Chen, Xin, Qian Miao, Bertrand M.T. Lin, Małgorzata Sterna, & Jacek Błażewicz. (2021). Two-machine flow shop scheduling with a common due date to maximize total early work. European Journal of Operational Research. 300(2). 504–511. 9 indexed citations
12.
Lin, Bertrand M.T., et al.. (2021). Scheduling of Anaesthesia Operations in Operating Rooms. Healthcare. 9(6). 640–640. 5 indexed citations
13.
Cheng, T.C.E., Svetlana A. Kravchenko, & Bertrand M.T. Lin. (2020). Scheduling step-deteriorating jobs to minimize the total completion time. Computers & Industrial Engineering. 144. 106329–106329. 13 indexed citations
14.
Wu, Chin‐Chia, et al.. (2020). Robust scheduling for a two-stage assembly shop with scenario-dependent processing times. International Journal of Production Research. 59(17). 5372–5387. 34 indexed citations
15.
Cheng, T.C.E., Svetlana A. Kravchenko, & Bertrand M.T. Lin. (2019). Server scheduling on parallel dedicated machines with fixed job sequences. Naval Research Logistics (NRL). 66(4). 321–332. 11 indexed citations
16.
Błażewicz, Jacek, Xin Chen, Richard C. T. Lee, et al.. (2018). Clarification of lower bounds of two-machine flow-shop scheduling to minimize total late work. Engineering Optimization. 51(7). 1279–1280. 7 indexed citations
17.
Hwang, Feng-Jang & Bertrand M.T. Lin. (2018). Survey and extensions of manufacturing models in two-stage flexible flow shops with dedicated machines. Computers & Operations Research. 98. 103–112. 9 indexed citations
18.
Cheng, T.C.E., Svetlana A. Kravchenko, & Bertrand M.T. Lin. (2017). Preemptive parallel‐machine scheduling with a common server to minimize makespan. Naval Research Logistics (NRL). 64(5). 388–398. 8 indexed citations
19.
Kononov, Alexander, et al.. (2015). Single-machine scheduling with supporting tasks. Discrete Optimization. 17. 69–79. 2 indexed citations
20.
Shyu, Shyong Jian, et al.. (2013). Discrete Particle Swarm Optimization with Scout Particles for Library Materials Acquisition. The Scientific World JOURNAL. 2013(1). 636484–636484. 3 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 Imed Kacem Breakdown of academic impact, for papers by Christos Koulamas Breakdown of academic impact, for papers by Vitaly A. Strusevich Breakdown of academic impact, for papers by Francisco Maturana Breakdown of academic impact, for papers by Brian Rodrigues Breakdown of academic impact, for papers by Artur Alves Pessoa Breakdown of academic impact, for papers by Saïd Hanafi Breakdown of academic impact, for papers by Sanja Petrović Breakdown of academic impact, for papers by Paul Valckenaers Breakdown of academic impact, for papers by Richard W. Conway
Rankless by CCL
2026