Win-Chin Lin

805 total citations
54 papers, 669 citations indexed

About

Win-Chin Lin is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Win-Chin Lin has authored 54 papers receiving a total of 669 indexed citations (citations by other indexed papers that have themselves been cited), including 53 papers in Industrial and Manufacturing Engineering, 14 papers in Computer Networks and Communications and 4 papers in Artificial Intelligence. Recurrent topics in Win-Chin Lin's work include Scheduling and Optimization Algorithms (51 papers), Advanced Manufacturing and Logistics Optimization (38 papers) and Assembly Line Balancing Optimization (31 papers). Win-Chin Lin is often cited by papers focused on Scheduling and Optimization Algorithms (51 papers), Advanced Manufacturing and Logistics Optimization (38 papers) and Assembly Line Balancing Optimization (31 papers). Win-Chin Lin collaborates with scholars based in Taiwan, China and Tunisia. Win-Chin Lin's co-authors include Chin‐Chia Wu, Shuenn‐Ren Cheng, Xingong Zhang, Danyu Bai, Jianyou Xu, Wen-Hsiang Wu, Yunqiang Yin, Dujuan Wang, Lining Xing and Chuanli Zhao and has published in prestigious journals such as Expert Systems with Applications, IEEE Access and Journal of the Operational Research Society.

In The Last Decade

Win-Chin Lin

52 papers receiving 650 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Win-Chin Lin Taiwan 16 609 151 58 31 30 54 669
Alper Hamzadayı Türkiye 11 476 0.8× 67 0.4× 102 1.8× 37 1.2× 20 0.7× 22 580
Jarosław Pempera Poland 11 636 1.0× 157 1.0× 108 1.9× 42 1.4× 22 0.7× 30 686
Damla Kızılay Türkiye 15 529 0.9× 63 0.4× 66 1.1× 17 0.5× 18 0.6× 27 567
Zhaohui Liu China 15 499 0.8× 288 1.9× 21 0.4× 30 1.0× 17 0.6× 52 545
Luis Fanjul-Peyro Spain 8 532 0.9× 126 0.8× 80 1.4× 20 0.6× 28 0.9× 8 573
Liji Shen Germany 16 658 1.1× 128 0.8× 86 1.5× 27 0.9× 36 1.2× 24 757
Małgorzata Sterna Poland 17 721 1.2× 325 2.2× 42 0.7× 34 1.1× 45 1.5× 35 773
Mansour Eddaly Tunisia 9 308 0.5× 60 0.4× 86 1.5× 21 0.7× 13 0.4× 24 421
L. Y. Chan Hong Kong 10 581 1.0× 58 0.4× 52 0.9× 20 0.6× 40 1.3× 13 617

Countries citing papers authored by Win-Chin Lin

Since Specialization
Citations

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

Fields of papers citing papers by Win-Chin Lin

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Win-Chin Lin

This figure shows the co-authorship network connecting the top 25 collaborators of Win-Chin Lin. A scholar is included among the top collaborators of Win-Chin 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 Win-Chin Lin. Win-Chin 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.
Liu, Xi, et al.. (2025). A multi-objective flexible flow shop scheduling problem with an improved NSGA-Ⅱ algorithm. Journal of Industrial and Management Optimization. 21(5). 4041–4062. 1 indexed citations
2.
Wu, Chin‐Chia, et al.. (2024). A robust single-machine scheduling problem with scenario-dependent processing times and release dates. International Journal of Industrial Engineering Computations. 16(1). 37–50. 1 indexed citations
3.
Xu, Jianyou, et al.. (2024). A bi-criterion sequence-dependent scheduling problem with order deliveries. PeerJ Computer Science. 10. e1763–e1763.
4.
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
5.
Xu, Jianyou, et al.. (2023). A Two-Machine Learning Date Flow-Shop Scheduling Problem with Heuristics and Population-Based GA to Minimize the Makespan. Mathematics. 11(19). 4060–4060. 3 indexed citations
6.
Lin, Win-Chin, Danyu Bai, Xingong Zhang, et al.. (2023). Composite heuristics and water wave optimality algorithms for tri-criteria multiple job classes and customer order scheduling on a single machine. International Journal of Industrial Engineering Computations. 14(2). 265–274. 4 indexed citations
7.
Lin, Win-Chin, et al.. (2023). Sequencing single machine multiple-class customer order jobs using heuristics and improved simulated annealing algorithms. RAIRO. Operations research. 57(3). 1417–1441. 2 indexed citations
8.
Wu, Chin‐Chia, et al.. (2022). A bicriterion single-machine scheduling problem with step-improving processing times. Computers & Industrial Engineering. 171. 108469–108469. 7 indexed citations
9.
Lin, Win-Chin, et al.. (2022). A Robust Single-Machine Scheduling Problem with Two Job Parameter Scenarios. Mathematics. 10(13). 2176–2176. 1 indexed citations
10.
Xu, Jianyou, et al.. (2022). Application of an Adaptive Adjacency Matrix-Based Graph Convolutional Neural Network in Taxi Demand Forecasting. Mathematics. 10(19). 3694–3694. 4 indexed citations
11.
Zhang, Xingong, Danyu Bai, Win-Chin Lin, Shuenn‐Ren Cheng, & Chin‐Chia Wu. (2021). Single-machine slack due-window assignment scheduling with multiple maintenance activities and position-and-resource-dependent processing times. International Journal of Systems Science Operations & Logistics. 10(1). 4 indexed citations
12.
Zhang, Xingong, et al.. (2020). Parallel-machine scheduling with linear deteriorating jobs and preventive maintenance activities under a potential machine disruption. Computers & Industrial Engineering. 145. 106482–106482. 30 indexed citations
13.
Lin, Win-Chin, et al.. (2020). A Robust Two-Machine Flow-Shop Scheduling Model with Scenario-Dependent Processing Times. Discrete Dynamics in Nature and Society. 2020. 1–16. 12 indexed citations
14.
Wu, Chin‐Chia, et al.. (2020). Metaheuristics for two-stage flow-shop assembly problem with a truncation learning function. Engineering Optimization. 53(5). 843–866. 19 indexed citations
15.
Xu, Jianyou, et al.. (2019). An iterated local search and tabu search for two-parallel machine scheduling problem to minimize the maximum total completion time. Journal of Information and Optimization Sciences. 40(3). 751–766. 6 indexed citations
16.
Lin, Win-Chin. (2018). Minimizing the Makespan for a Two-Stage Three-Machine Assembly Flow Shop Problem with the Sum-of-Processing-Time Based Learning Effect. Discrete Dynamics in Nature and Society. 2018. 1–15. 10 indexed citations
17.
Lin, Win-Chin, et al.. (2017). On the Use of Genetic Algorithm for Solving Re-entrant Flowshop Scheduling with Sum-of-processing-times-based Learning Effect to Minimize Total Tardiness. Intelligent Automation & Soft Computing. 1–11. 1 indexed citations
18.
Zhang, Xingong, Win-Chin Lin, Wen-Hsiang Wu, & Chin‐Chia Wu. (2016). Single-machine common/slack due window assignment problems with linear decreasing processing times. Engineering Optimization. 49(8). 1388–1400. 19 indexed citations
19.
Xu, Jianyou, et al.. (2016). An order scheduling problem with position-based learning effect. Computers & Operations Research. 74. 175–186. 41 indexed citations
20.
Lin, Win-Chin, et al.. (2013). Two-Agent Single-Machine Scheduling of Jobs with Time-Dependent Processing Times and Ready Times. Mathematical Problems in Engineering. 2013. 1–13. 6 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 Alper Hamzadayı Breakdown of academic impact, for papers by Jarosław Pempera Breakdown of academic impact, for papers by Damla Kızılay Breakdown of academic impact, for papers by Zhaohui Liu Breakdown of academic impact, for papers by Luis Fanjul-Peyro Breakdown of academic impact, for papers by Liji Shen Breakdown of academic impact, for papers by Małgorzata Sterna Breakdown of academic impact, for papers by Mansour Eddaly Breakdown of academic impact, for papers by L. Y. Chan
Rankless by CCL
2026